697 search results - page 4 / 140 » On the Theory of Average Case Complexity |
RANDOM
1997
Springer
13 years 12 months ago
1997
Springer
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
FOCS
2003
IEEE
14 years 1 months 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...