The Quantitative Structure of Exponential Time-Reference-Cited by-同舟云学术

The Quantitative Structure of Exponential Time

Published:1997 Issue: Volume: Page:225-260
ISSN:
Container-title:Complexity Theory Retrospective II
language:
Short-container-title:

Author:

Lutz Jack H.

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-1872-2_10.pdf

Reference94 articles.

1. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizing over polyno-mial time computable sets. Theoretical Computer Science, 51:177–204, 1987.

2. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizing over deterministic polynomial time. In Proceedings of Computer Science Logic ‘87,pages 1–16. Lecture Notes in Computer Science, vol. 329, Springer-Verlag, Berlin, 1988.

3. K. Ambos-Spies. Randomness, relativizations, and polynomial reducibilities. In Proceedings of the First Conference on Structure in Complexity Theory, pages 23–34. Lecture Notes in Computer Science, vol. 223, Springer-Verlag, Berlin, 1986.

4. K. Ambos-Spies. Resource-bounded genericity. In Proceedings of the Tenth Annual IEEE Conference on Structure in Complexity Theory, pages 162–181, 1995.

5. K. Ambos-Spies, E. Mayordomo, Y. Wang, and X. Zheng. Resource-bounded dense genericity, stochasticity and weak randomness. In Proceedings of the Thirteenth Annual Symposium on Theoretical Aspects of Computer Science, pages 63–74. Lecture Notes in Computer Science, vol. 1046, Springer-Verlag, Berlin, 1996.

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dimension and the Structure of Complexity Classes;Theory of Computing Systems;2022-08-17

2. Nonuniform Reductions and NP-Completeness;Theory of Computing Systems;2022-06-01

3. Nondeterminisic Sublinear Time Has Measure 0 in P;Theory of Computing Systems;2018-06-28

4. The Mathematical Foundations of Randomness;The Frontiers Collection;2016

5. Hard Instances of Algorithms and Proof Systems;ACM Transactions on Computation Theory;2014-05