145 search results - page 23 / 29 » BQP and the Polynomial Hierarchy |
154
click to vote
COCO
2007
Springer
16 years 6 days ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
170
click to vote
TCC
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
155
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
154
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
185
click to vote
ICSOC
2004
Springer
15 years 11 months ago
2004
Springer
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...