400 search results - page 36 / 80 » Lower Bounds Using Kolmogorov Complexity |
STACS
2009
Springer
14 years 4 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
ALGORITHMICA
2002
13 years 9 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
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...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...