332 search results - page 1 / 67 » Space Complexity vs. Query Complexity |
76
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
77
Voted
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
91
Voted
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We incorporate sampling-based global path planning with Visual Servoing (VS) for a robotic arm equipped with an in-hand camera. The path planning accounts for a number ...
116
click to vote
COCO
2000
Springer
15 years 1 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
PODS
2004
ACM
15 years 9 months ago
2004
ACM