| 2009 |
|---|
| 16 | EE | Olaf Beyersdorff,
Johannes Köbler,
Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice.
LATA 2009: 164-175 |
| 2008 |
|---|
| 15 | EE | Olaf Beyersdorff,
Sebastian Müller:
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.
CSL 2008: 199-214 |
| 14 | EE | Olaf Beyersdorff:
Logical Closure Properties of Propositional Proof Systems.
TAMC 2008: 318-329 |
| 13 | EE | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic
CoRR abs/0808.3884: (2008) |
| 12 | EE | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Propositional Implication
CoRR abs/0811.0959: (2008) |
| 11 | EE | 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 | EE | Olaf Beyersdorff:
Tuples of Disjoint NP-Sets.
Theory Comput. Syst. 43(2): 118-135 (2008) |
| 2007 |
|---|
| 9 | EE | Olaf Beyersdorff:
The Deduction Theorem for Strong Propositional Proof Systems.
FSTTCS 2007: 241-252 |
| 8 | EE | Olaf Beyersdorff:
Classes of representable disjoint NP-pairs.
Theor. Comput. Sci. 377(1-3): 93-109 (2007) |
| 2006 |
|---|
| 7 | EE | Olaf Beyersdorff:
Tuples of Disjoint NP-Sets.
CSR 2006: 80-91 |
| 6 | EE | Olaf Beyersdorff:
Disjoint NP-Pairs from Propositional Proof Systems.
TAMC 2006: 236-247 |
| 5 | EE | Olaf Beyersdorff:
On the Deduction Theorem and Complete Disjoint NP-Pairs.
Electronic Colloquium on Computational Complexity (ECCC) 13(142): (2006) |
| 2005 |
|---|
| 4 | EE | Olaf Beyersdorff:
Disjoint NP-Pairs from Propositional Proof Systems
Electronic Colloquium on Computational Complexity (ECCC)(083): (2005) |
| 3 | EE | Olaf Beyersdorff:
Tuples of Disjoint NP-Sets
Electronic Colloquium on Computational Complexity (ECCC)(123): (2005) |
| 2004 |
|---|
| 2 | EE | Olaf Beyersdorff:
Representable Disjoint NP-Pairs.
FSTTCS 2004: 122-134 |
| 1 | EE | Olaf Beyersdorff:
Representable Disjoint NP-Pairs
Electronic Colloquium on Computational Complexity (ECCC)(082): (2004) |
