Author:
Cai Jin-yi,Hemachandra Lane
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. C. Bennett and J. Gill, “Relative to a Random Oracle, P A ≠ NP A ≠ coNP A with Probability 1,” SIAM Journal on Computing, Vol. 10, #1, Feb. 1981, pp. 96–113.
2. A. Blass and Y. Gurevich, “On the Unique Satisfiability Problem”, Information and Control, 55, 1982, pp. 80–88.
3. T. Baker and A. Selman, “A Second Step Towards the Polynomial Hierarchy,” Theoretical Computer Science, 8, 1979, pp. 177–187.
4. Jin-yi Cai and Lane Hemachandra, “The Boolean Hierarchy: Hardware over NP,” Cornell Computer Science Department Technical Report TR85-724, December 1985.
5. S.A. Cook, “The Complexity of Theorem-Proving Procedures,” Proceedings of the 3 rd Annual Symposium on the Theory of Computation, 1971, pp. 151–158.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献