Average-case Complexity

@article{Trevisan2006AveragecaseC,
  title={Average-case Complexity},
  author={Luca Trevisan},
  journal={2008 49th Annual IEEE Symposium on Foundations of Computer Science},
  year={2006},
  pages={11-11}
}
We review the many open questions and the few things that are known about the average-case complexity of computational problems. We shall follow the presentations of Impagliazzo, of Goldreich, and of Bogdanov and the author, and focus on the following subjects. (i). Average-case tractability. What does it mean for a problem to have an "efficient on average'' algorithm with respect to a distribution of instances? There is more than one ``correct'' answer to this question, and a numberof… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

Smoothed Complexity Theory

View 8 Excerpts
Highly Influenced

Encoding Invariance in Average Case Complexity

Theory of Computing Systems • 2013
View 5 Excerpts
Highly Influenced

An infinitely-often one-way function based on an average-case assumption

Electronic Colloquium on Computational Complexity • 2007
View 4 Excerpts
Highly Influenced

Non-black-box Worst-case to Average-case Reductions within NP

Electronic Colloquium on Computational Complexity • 2018
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…