Author:
Furst Merrick,Saxe James B.,Sipser Michael
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference21 articles.
1. D. Angluin, Counting problems and the polynomial-time hierarchy.Theoretical Computer Science, to appear.
2. N. Blum, A 2.75n lower bound for the combinational complexity of boolean functions. University of Saarbrucken, Technical Report.
3. T. Baker, J. Gill, and R. Solovay, Relativizations of theP =? NP question.SIAM Journal of Computing, 4, 4, 1975.
4. T. Baker and A. Selman, A second step toward the polynomial hierarchy.Theoretical Computer Science, 8, 2, 1979, pp. 177–187.
5. A. Chandra, D. Kozen, and L. Stockmeyer, Alternation.Journal of the ACM, 28, 1, January 1981.
Cited by
627 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On small-depth Frege proofs for PHP;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Top-Down Lower Bounds for Depth-Four Circuits;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Borel complexity and Ramsey largeness of sets of oracles separating complexity classes;Mathematical Logic Quarterly;2023-08
4. Quantum Cryptography in Algorithmica;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. On the Consistency of Circuit Lower Bounds for Non-deterministic Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02