Author:
Buhrman Harry,Thierauf Thomas
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I & II. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1988, 1991)
2. Beigel, R.: NP-hard sets are P-superterse unless R=NP. Technical Report 88-04, Dept. of Computer Science, The John Hopkins University (1988).
3. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 55 (1982) 80–88
4. Buhrman, H., Kadin, J., Thierauf, T.: On functions computable with nonadaptive queries to NP. Proc. 9th Structure in Complexity Theory Conference (1994) 43–52
5. Chang, R., Kadin, J., Rohatgi, P.: On Unique Satisfiability and the threshhold behavior of randomized reductions. Journal of Computer and System Science 50 (1995) 359–373.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some structural properties of SAT;Journal of Computer Science and Technology;2000-09
2. Resource-bounded kolmogorov complexity revisited;Lecture Notes in Computer Science;1997