145 search results - page 17 / 29 » BQP and the Polynomial Hierarchy |
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
77
Voted
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
74
Voted
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...