5 search results - page 1 / 1 » Bounded Queries and the NP Machine Hypothesis |
COCO
2007
Springer
13 years 11 months 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...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
COLT
1998
Springer
13 years 9 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
ECCC
2008
13 years 5 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
ALT
2006
Springer
14 years 1 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...