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
641 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fine-grained polynomial functional encryption;Theoretical Computer Science;2024-10
2. Designing Universally-Approximating Deep Neural Networks: A First-Order Optimization Approach;IEEE Transactions on Pattern Analysis and Machine Intelligence;2024-09
3. Computationally Hard Problems for Logic Programs under Answer Set Semantics;ACM Transactions on Computational Logic;2024-07-10
4. On the Pauli Spectrum of QAC0;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10