406 search results - page 79 / 82 » Pseudorandomness and Combinatorial Constructions |
188
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
178
click to vote
FOCS
2006
IEEE
16 years 21 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
185
click to vote
COMPGEOM
2006
ACM
16 years 18 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
216
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
190
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...