Publisher
Springer Berlin Heidelberg
Reference43 articles.
1. Beigel, R. “Bounded Queries to SAT and the Boolean Hierarchy”, manuscript, June 1987.
2. Baker, T., J. Gill, and R. Solovay. “Relativizations of the P =? NP Question”, SIAM Journal on Computing, 4(4):431–442, December 1975.
3. Berman, L. and J. Hartmanis. “On Isomorphisms and Density of NP and Other Complete Sets”, SIAM Journal on Computing, 6(2):305–322, June 1977.
4. Cai, J. and L. Hemachandra. “The Boolean Hierarchy: Hardware Over NP”, Technical Report, TR 85-724, Cornell Department of Computer Science, December 1985.
5. Cai, J. and L. Hemachandra. “The Boolean Hierarchy: Hardware Over NP”, Structure in Complexity Theory, pp. 105–124, Springer-Verlag Lecture Notes in Computer Science, No. 223, 1986.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献