Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference22 articles.
1. Beyersdorff, O.: Classes of representable disjoint NP-pairs. Theor. Comput. Sci. 377, 93–109 (2007)
2. Lecture Notes in Computer Science;O. Beyersdorff,2007
3. Lecture Notes in Computer Science;O. Beyersdorff,2008
4. Beyersdorff, O.: Tuples of disjoint NP-sets. Theory Comput. Syst. 43(2), 118–135 (2008)
5. Bonet, M.L.: Number of symbols in Frege proofs with and without the deduction rule. In: Clote, P., Krajíček, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, pp. 61–95. Oxford University Press, Oxford (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献