59 search results - page 10 / 12 » Nonadaptive quantum query complexity |
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
COCO
2003
Springer
14 years 4 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...