1132 search results - page 5 / 227 » Structure in Average Case Complexity |
FOCS
2003
IEEE
14 years 12 days ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
FSTTCS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...