Olaf Beyersdorff

	2009
21		Olaf Beyersdorff, Zenon Sadowski: Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. CSR 2009: 47-58
20		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Nondeterministic Instance Complexity and Proof Systems with Advice. LATA 2009: 164-175
19		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64
18		Olaf Beyersdorff, Sebastian Müller: Does Advice Help to Prove Propositional Tautologies? SAT 2009: 65-72
17		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009)
16		Olaf Beyersdorff, Johannes Köbler, Jochen Messner: Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38-40): 3839-3855 (2009)
	2008
15		Olaf Beyersdorff, Sebastian Müller: A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. CSL 2008: 199-214
14		Olaf Beyersdorff: Logical Closure Properties of Propositional Proof Systems. TAMC 2008: 318-329
13		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic CoRR abs/0808.3884: (2008)
12		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Propositional Implication CoRR abs/0811.0959: (2008)
11		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Nondeterministic Instance Complexity and Proof Systems with Advice. Electronic Colloquium on Computational Complexity (ECCC) 15(075): (2008)
10		Olaf Beyersdorff: Tuples of Disjoint NP-Sets. Theory Comput. Syst. 43(2): 118-135 (2008)
	2007
9		Olaf Beyersdorff: The Deduction Theorem for Strong Propositional Proof Systems. FSTTCS 2007: 241-252
8		Olaf Beyersdorff: Classes of representable disjoint NP-pairs. Theor. Comput. Sci. 377(1-3): 93-109 (2007)
	2006
7		Olaf Beyersdorff: Tuples of Disjoint NP-Sets. CSR 2006: 80-91
6		Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems. TAMC 2006: 236-247
5		Olaf Beyersdorff: On the Deduction Theorem and Complete Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC) 13(142): (2006)
	2005
4		Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(083): (2005)
3		Olaf Beyersdorff: Tuples of Disjoint NP-Sets Electronic Colloquium on Computational Complexity (ECCC)(123): (2005)
	2004
2		Olaf Beyersdorff: Representable Disjoint NP-Pairs. FSTTCS 2004: 122-134
1		Olaf Beyersdorff: Representable Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC)(082): (2004)

Coauthor Index

1	Johannes Köbler	[11] [16] [20]
2	Arne Meier	[12] [13] [17] [19]
3	Jochen Messner (Jochen Meßner)	[16]
4	Sebastian Müller	[11] [15] [18] [20]
5	Zenon Sadowski	[21]
6	Michael Thomas	[12] [13] [17] [19]
7	Heribert Vollmer	[12] [13] [17] [19]

Colors in the list of coauthors