Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Beyersdorff, O.: Representable disjoint NP-pairs. In: Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 122–134 (2004)
2. Beyersdorff, O.: Tuples of disjoint NP-sets. Technical Report TR05-123, Electronic Colloquium on Computational Complexity (2005)
3. Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. In: Proc. 3rd Conference on Theory and Applications of Models of Computation (2006)
4. Buss, S.R.: Bounded Arithmetic. Bibliopolis, Napoli (1986)
5. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic 44, 36–50 (1979)