Author:
Antunes Luis,Fortnow Lance,van Melkebeek Dieter,Vinodchandran N.V.
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
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. On non-uniform polynomial space;Balcázar,1986
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. On the theory of average case complexity;Ben-David;J. Comput. System Sci.,1992
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pebble-depth;Theoretical Computer Science;2024-09
2. Beating Brute Force for Compression Problems;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Planted Clique Conjectures Are Equivalent;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics);Theory of Probability & Its Applications;2024-02
5. Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06