Computational depth: Concept and applications

Theoretical Computer Science

Volumn 354, Issue 3, 2006, Pages 391-404

  Antunes, Luis ^a   Fortnow, Lance ^b   Van Melkebeek, Dieter ^c   Vinodchandran, N V ^d  

^a UNIVERSITY OF PORTO   (Portugal)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c University of Wisconsin Madison   (United States)

^d UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Kolmogorov complexity; Structural complexity and average case complexity

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INFORMATION ANALYSIS; POLYNOMIALS;

AVERAGE CASE COMPLEXITY; KOLMOGOROV COMPLEXITY; STRUCTURAL COMPLEXITY;

COMPUTATIONAL METHODS;

EID: 33644778692     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.033     Document Type: Conference Paper

References (25)

1. L. Antunes, L. Fortnow, D. van Melkebeek, Computational depth, in: Proc. 16th IEEE Conf. Computational Complexity, 2001, pp. 266-273.
2. L. Antunes, L. Fortnow, N.V. Vinodchandran, Using depth to capture average-case complexity, in: 14th Internat. Symp. Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 2751, Springer, Berlin, 2003, pp. 303-310.
3. J.L. Balcázar, J. Díaz, and J. Gabarró On non-uniform polynomial space A.L. Selman Structure in Complexity Theory 1986 Springer Berlin
4. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Vol. 11, Springer, Berlin, 1995.
5. S. Ben-David, B. Chor, O. Goldreich, and M. Luby On the theory of average case complexity J. Comput. System Sci. 44 2 1992 193 219
6. C.H. Bennett Logical depth and physical complexity R. Herken The Universal Turing Machine: A Half-Century Survey 1988 Oxford University Press Oxford 227 257
7. A with probability one SIAM J. Comput. 10 1981 96 113
8. P. Bro Miltersen The complexity of malign measures SIAM J. Comput. 22 1 1993 147 156
9. H. Buhrman, and L. Fortnow Resource-bounded Kolmogorov complexity revisited Proc. 14th Symp. Theoretical Aspects of Computer Science 1997 Springer Berlin 105 116
10. H. Buhrman, S. Laplante, and P. Bro Miltersen New bounds for the language compression problem Proc. 15th IEEE Conf. Computational Complexity 2000 IEEE New York
11. L. Fortnow, and M. Kummer On resource-bounded instance complexity Theoret. Comput. Sci. 161 1996 123 140
12. L. Fortnow, and S. Laplante Nearly optimal language compression using extractors Proc. 15th Symp. Theoretical Aspects of Computer Science 1998 Springer Berlin 84 93
13. R. Karp, and R. Lipton Some connections between nonuniform and uniform complexity classes Proc. 12th ACM Symp. Theory of Computing 1980 ACM New York 302 309
14. L.A. Levin Universal search problems Problems Inform. Transmission 9 1973 265 266
15. L.A. Levin Randomness conservation inequalities: information and independence in mathematical theories Inform. and Control 61 1984 15 37
16. L.A. Levin Average case complete problems SIAM J. Comput. 15 1 1986 285 286
17. M. Li, and P. Vitanyi Average case complexity under the universal distribution equals worst-case complexity Inform. Process. Lett. 42 3 1992 145 149
18. M. Li, and P. Vitányi An Introduction to Kolmogorov Complexity and its Applications second ed. 1997 Springer Berlin
19. N. Nisan, and A. Wigderson Hardness vs. randomness J. Comput. System Sci. 49 1994 149 167
20. R. Pagh, Low redundancy in static dictionaries with O(1 )lookup time, in: Proc. 26th Internat. Colloq. Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 595-604.
21. C. Papadimitriou Computational Complexity 1994 Addison-Wesley Publishing Company Reading, MA
22. R. Schuler, Universal distributions and time-bounded Kolmogorov complexity, in: Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science, 1999, pp. 434-443.
23. M. Sipser, A complexity theoretic approach to randomness, in: Proc. 15th ACM Symp. Theory of Computing, 1983, pp. 330-335.
24. A. Ta-Shma, On extracting randomness from weak random sources. in: Proc. 28th Annual ACM Symp. Theory of Computing, 22-24 May 1996, pp. 276-285.
25. J. Wang, Average-case computational complexity theory, in: Alan L. Selman (Ed.), Complexity Theory Retrospective, Vol. 2, 1997.