Skip to main content
SpringerLink
Log in

Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory

  • Chapter
Kolmogorov Complexity and Computational Complexity

Part of the book series: EATCS Monographs on Theoretical Computer Science ((EATCS))

Abstract

This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the complexity of sets, and outlines a number of applications of this approach to different questions in complexity theory. Connections will be drawn among the following topics: NE predicates, ranking functions, pseudorandom generators, and hierarchy theorems in circuit complexity.

Preparation of this paper was supported in part by the National Science Foundation under Grant CCR-9000045.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Allender. Invertible Functions. PhD thesis, Georgia Institute of Technology, 1985.

    Google Scholar 

  2. E. Allender. Some consequences of the existence of pseudorandom generators. J. Comput. System Sci. 39:101–124, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  3. E. Allender. The generalized Kolmogorov complexity of sets. In Proc. 4th IEEE Structure in Complexity Theory Conf. pages 186–194, 1989.

    Google Scholar 

  4. E. Allender and V, Gore. On strong separations from AC 0 In Proc. Fundamentals of Computation Theory, Springer-Verlag, Lecture Notes in Computer Science 529:1–15, 1991.

    Google Scholar 

  5. E. Allender and R. Rubinstein. P-printable sets.SIAM J. Comput. 17:1193–1202,1988.

    Article  MathSciNet  MATH  Google Scholar 

  6. E. Allender and O. Watanabe. Kolmogorov complexity and degrees of tally sets.Inform, and Computation 86:160–178, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  7. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizations over polynomial-time computable sets.Theoret. Comput. Sci. 51:177–204,1987.

    Article  MathSciNet  MATH  Google Scholar 

  8. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM J. Comput. 4:431–444, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Balcazar, J. Diaz, and J. Gabarro. Characterizations of the class PSPACE/poly. Theoret. Comput. Sci. 52:251–267,1987.

    Article  MathSciNet  MATH  Google Scholar 

  10. C. Bennett and J. Gill. Relative to a random oracle, P(A) ≠ NP(A) ≠ Co-NP(A) with probability 1. SIAM J. Comput. 10:96–113, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Bertoni, M. Goldwurm, and P. Massazza. Counting problems and algebraic formal power series in noncommuting variables. Inform. Processing Letters 34:117–121,1990.

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Bertoni, M. Goldwurm, and N. Sabadini. The complexity of computing the number of strings of given length in context-free languages. Theoret. Comput. Sci. 86:325–342, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  13. D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity within NC 1 . J. Comput. System Sci. 41:274–306,1990.

    Article  MathSciNet  MATH  Google Scholar 

  14. M. Blum. A machine-independent theory of the complexity of recursive functions. J. ACM 14:322–336, 1967.

    Article  MATH  Google Scholar 

  15. M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In Proc. 28th IEEE Symp. Foundations of Computer Science, pages 118–126, 1987.

    Google Scholar 

  16. R. Book. Some observations on separating complexity classes. SI AM J. Comput. 20:246–258, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  17. R. Book. On sets with small information content. In this volume.

    Google Scholar 

  18. R. Boppana and R. Hirschfeld. Pseudorandom generators and complexity classes. InAdvances in Computing Research. Volume 5: Randomness and Computation, pages 1–26. Edited by S. Micali. JAI Press, Greenwich, CT, 1988.

    Google Scholar 

  19. R. Boppana and M. Sipser. The complexity of finite functions. In Handbook of Theoretical Computer Science. Vol. A: Algorithms and Complexity pages 757–804. Edited by J. van Leeuwen. MIT Press (in the United States, Canada, and Japan), and Elsevier Science Publishers (in other countries), 1990.

    Google Scholar 

  20. J.-Y. Cai. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. J. Comput. System Sci. 38:68–85, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  21. B. Chor, O. Goldreich, and J. Hastad. The random oracle hypothesis is false. Technical report 631, Department of Computer Science, Technion - Israel Institute of Technology, 1990.

    Google Scholar 

  22. M. Dowd. Forcing and the P hierarchy. Technical report LCSR-TR-35, Laboratory for Computer Science Research, Rutgers University, 1982.

    Google Scholar 

  23. S. Fenner. Notions of resource-bounded category and genericity. In Proc. 6th IEEE Structure in Complexity Theory Conf., pages 196–212, 1991.

    Google Scholar 

  24. W. Gasarch. Oracles: three new results. In Mathematical Logic and Theoretical Computer Science, Marcel Dekker, Inc., Lecture Notes in Pure and Applied Mathematics 106:219–251,1987.

    Google Scholar 

  25. A. Goldberg and M. Sipser. Compression and ranking. SIAM J. Comput. 20:524–536, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  26. V. Gore. Personal communication.

    Google Scholar 

  27. J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computations. In Proc. 24th IEEE Symp. Foundations of Computer Science, pages 439–445, 1983.

    Google Scholar 

  28. J. Hartmanis, R. Chang, D. Ranjan, and P. Rohatgi. Structural complexity theory: recent surprises. InProc. 2nd Scandinavian Workshop on Algorithm Theory, Springer-Verlag, Lecture Notes in Computer Science 447:1–12, 1990.

    Google Scholar 

  29. J. Hartmanis and L. Hemachandra. On sparse oracles separating feasible complexity classes. Inform. Processing Letters 28:291–296, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  30. J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities.Theoret. Comput. Sci. 34:17–32, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  31. J. Hastad. Computational Limitations for Small-Depth Circuits. MIT Press, sss 1986.

    Google Scholar 

  32. J. Hastad. Pseudo-random generators under uniform assumptions. In Proc. 22nd ACM Symp. Theory of Computing, pages 395–404, 1990.

    Google Scholar 

  33. L. Hemachandra and S. Rudich. On the complexity of ranking. J. Comput. System Sci. 41:251–271, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  34. D. Huynh. Non-uniform complexity and the randomness of certain complete languages. Technical report TR 85–34, Computer Science Department, Iowa State University, 1985.

    Google Scholar 

  35. D. Huynh. Resource-bounded Kolmogorov complexity of hard languages. In Proc. Structure in Complexity Theory, Springer-Verlag, Lecture Notes in Computer Science 223:184–195, 1986.

    Google Scholar 

  36. D. Huynh. The complexity of ranking simple languages.Math. Systems Theory 23:1–20, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  37. D. Huynh. Efficient detectors and constructors for simple languages. Technical report UTDCS-26–90, Computer Science Program, University of Texas at Dallas, sss 1990.

    Google Scholar 

  38. R. Impagliazzo and G. Tardos. Decision versus search in super-polynomial time. In Proc. 30th IEEE Symp. Foundations of Computer Science, pages 222–227,1989.

    Google Scholar 

  39. R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proc. 21st ACM Symp. Theory of Computing, pages 12–24, 1989.

    Google Scholar 

  40. M. Kharitonov, A. Goldberg, and M. Yung. Lower bounds for pseudorandom number generators. In Proc. 30th IEEE Symp. Foundations of Computer Science, pages 242–247, 1989.

    Google Scholar 

  41. K. Ko. On the notion of infinite pseudorandom sequences.Theoret. Com- put. Sci. 48:9–33, 1986.

    Article  MATH  Google Scholar 

  42. S. Kurtz. Notions of weak genericity. J. Symbolic Logic 48:764–770, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  43. S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails relative to a random oracle. In Proc. 21st ACM Symp. Theory of Computing pages 157–166, 1989.

    Google Scholar 

  44. S. Kurtz, S. Mahaney, and J. Royer. Average dependence and random oracles. Technical report SU-CIS-91–03, School of Computer and Information Science, Syracuse University, 1991.

    Google Scholar 

  45. S. Kurtz. On the random oracle hypothesis. Inform, and Control 57:40–47, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  46. L. Levin. Universal sequential search problems. Problems Inform. Transmission 9:265–266, 1973.

    Google Scholar 

  47. L. Levin. Randomness conservation inequalities; information and independence in mathematical theories. Inform, and Control 61:15–37, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  48. M. Li and P. Vitanyi. Applications of Kolmogorov complexity in the theory of computation. In Complexity Theory Retrospective, pages 147–203. Edited by A. Selman. Springer-Verlag, 1990.

    Chapter  Google Scholar 

  49. J. Lutz. Category and measure in complexity classes. SI AM J. Comput. 19:1100–1131,1990.

    Article  MathSciNet  MATH  Google Scholar 

  50. J. Lutz. Almost everywhere high nonuniform complexity.J. Comput. System Sex., to appear. A preliminary version appeared inProc. 4th IEEE Structure in Complexity Theory Confpages 37–53, 1989.

    Google Scholar 

  51. W. Maass. Recursively enumerable generic sets. J. Symbolic Logic 47:809–823, 1982.

    MathSciNet  Google Scholar 

  52. K. Mehlhorn. On the size of sets of computable functions. In Proc. 14th IEEE Symp. Switching and Automata Theory, pages 190–196, 1973.

    Chapter  Google Scholar 

  53. M. Mundhenk and R. Schuler. Non-uniform complexity classes and random languages. In Proc. 5th IEEE Structure in Complexity Theory Conf. pages 110–119,1990.

    Chapter  Google Scholar 

  54. J. Oxtoby.Measure and Category (second edition). Springer-Verlag, sss 1980.

    MATH  Google Scholar 

  55. B. Poizat. Q = NQ? J. Symbolic Logic 51:22–32, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  56. L. Sanchis and M. Fulk. On the efficient generation of language instances. SIAM J. Comput 19:281–296, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  57. M. Sipser. A complexity theoretic approach to randomness. In Proc. 15 th ACM Symp. Theory of Computing, pages 330–335, 1983.

    Google Scholar 

  58. A. Yao. Theory and applications of trapdoor functions. InProc. 23rd IEEE Symp. Foundations of Computer Science, pages 80–91, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, New Brunswick, NJ, 08903, USA

    Eric Allender

Authors
  1. Eric Allender
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, Ookayama, Tokyo 152, Japan

    Osamu Watanabe

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Allender, E. (1992). Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory. In: Watanabe, O. (eds) Kolmogorov Complexity and Computational Complexity. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77735-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77735-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-77737-0

  • Online ISBN: 978-3-642-77735-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation