Results 1 
2 of
2
On the Theory of Average Case Complexity
 Journal of Computer and System Sciences
, 1997
"... This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works [Levin 84, Gurevich 87, Venkatesan and Levin 88] have focused on the existence of complete problems. We widen the scope to other basic questions in computational complexity. ..."
Abstract

Cited by 106 (7 self)
 Add to MetaCart
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works [Levin 84, Gurevich 87, Venkatesan and Levin 88] have focused on the existence of complete problems. We widen the scope to other basic questions in computational complexity. Our results include: ffl the equivalence of search and decision problems in the context of average case complexity; ffl an initial analysis of the structure of distributionalNP (i.e. NP problems coupled with "simple distributions") under reductions which preserve average polynomialtime; ffl a proof that if all of distributionalNP is in average polynomialtime then nondeterministic exponentialtime equals deterministic exponential time (i.e., a collapse in the worst case hierarchy); ffl definitions and basic theorems regarding other complexity classes such as average logspace. An exposition of the basic definitions suggested by Levin and suggestions for some alternative definitions ...
On the Computational Complexity of Dynamic Graph Problems
 THEORETICAL COMPUTER SCIENCE
, 1996
"... ..."