2661 search results - page 141 / 533 » Quantum Complexity Classes |
JCSS
2006
15 years 3 months ago
2006
Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do...
114
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
139
Voted
PAMI
2007
15 years 2 months ago
2007
We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifier...
102
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
131
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...