Using depth to capture average-case complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 303-310

  Antunes, Luís ^a   Fortnow, Lance ^b   Vinodchandran, N V ^c  

^a UNIVERSITY OF PORTO   (Portugal)

^b NEC LABORATORIES AMERICA   (United States)

^c UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINERY; POLYNOMIAL APPROXIMATION;

AVERAGE-CASE COMPLEXITY; COMPUTATIONAL DEPTH; POLYNOMIAL-TIME;

TURING MACHINES;

EID: 33644748433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_28     Document Type: Article

References (11)

1. Luis Antunes, Lance Fortnow, and Dieter van Melkebeek. Computational depth. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 266-273, 2001.
2. S. Ben-David, B. Chor, O. Goldreich and M. Luby. On the theory of average case complexity. J. Computer System Sci., 44(2):193-219, 1992.
3. Charles H. Bennett. Logical depth and physical complexity. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 227-257. Oxford University Press, 1988.
4. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, August 1999.
5. Leonid A. Levin. Average case complete problems. SIAM Journal on Computing, 15(1):285-286, 1986.
6. Leonid A. Levin. Randomness conservation inequalities: information and independence in mathematical theories. Information and Control, 61:15-37, 1984.
7. Ming Li and Paul M. B. Vitanyi. Average case complexity under the universal distribution equals worst-case complexity. Information Processing Letters, 42(3):145-149, May 1992.
8. Ming Li and Paul M. B. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer, 2nd edition, 1997.
9. Peter Bro Miltersen. The complexity of malign measures. In SIAM Journal on Computing, 22(1):147-156, 1993.
10. Rainer Schuler. Universal distributions and time-bounded Kolmogorov complexity. In Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 434-443, 1999.
11. Jie Wang. Average-case computational complexity theory. In Alan L. Selman, Editor, Complexity Theory Retrospective, volume 2. 1997.