Author:
Glaßer Christian,Selman Alan L.,Zhang Liyu
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Ben-David, S., Gringauze, A.: On the existence of propositional proof systems and oracle-relativized propositional logic. Technical Report 5, Electronic Colloquium on Computational Complexity (1998)
2. Lecture Notes in Computer Science;H. Buhrman,2000
3. Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, 36–50 (1979)
4. Even, S., Selman, A., Yacobi, J.: The complexity of promise problems with applications to public-key cryptography. Information and Control 61, 159–173 (1984)
5. Glaßer, C., Selman, A., Sengupta, S.: Reductions between disjoint NP-pairs. In: Proceedings 19th IEEE Conference on Computational Complexity, pp. 42–53. IEEE Computer Society Press, Los Alamitos (2004)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献