1331 search results - page 117 / 267 » Complexity bounds for zero-test algorithms |
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
COCO
2008
Springer
13 years 12 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
ISAAC
2004
Springer
14 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 ...
NIPS
2001
13 years 11 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...