2661 search results - page 50 / 533 » Quantum Complexity Classes |
107
Voted
ENTCS
2011
14 years 7 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
105
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
83
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
The science of complexity is based on a new way of thinking that stands in sharp contrast to the philosophy underlying Newtonian science, which is based on reductionism, determinis...
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...