Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference9 articles.
1. T. Baker, J. Gill, and R. Solovay, Relativizations of the P=? NP question,SIAM J. Computing 4, 431–442 (1975).
2. R. V. Book, Bounded query machines: on NP and PSPACE, submitted.
3. R. V. Book and C. Wrathall, Bounded query machines: on NP () and NPQUERY(), submitted.
4. S. A. Cook, Characterizations of pushdown machines in terms of time-bounded computers,JACM 18, 4–18 (1971).
5. S. A. Cook, Deterministic CFL's are accepted simultaneously in polynomial time and log squared space,Proceedings of the 11th Annual ACM Symposium on Theory of Computing, 338–345 (1979).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献