| 2004 |
|---|
| 7 | EE | Juan Luis Esteban,
Nicola Galesi,
Jochen Messner:
On the complexity of resolution with bounded conjunctions.
Theor. Comput. Sci. 321(2-3): 347-370 (2004) |
| 2003 |
|---|
| 6 | EE | Johannes Köbler,
Jochen Messner,
Jacobo Torán:
Optimal proof systems imply complete sets for promise classes.
Inf. Comput. 184(1): 71-92 (2003) |
| 2002 |
|---|
| 5 | EE | Juan Luis Esteban,
Nicola Galesi,
Jochen Messner:
On the Complexity of Resolution with Bounded Conjunctions.
ICALP 2002: 220-231 |
| 4 | EE | Jochen Messner:
On the Structure of the Simulation Order of Proof Systems.
MFCS 2002: 581-592 |
| 2000 |
|---|
| 3 | EE | Johannes Köbler,
Jochen Messner:
Is the Standard Proof System for SAT P-Optimal?
FSTTCS 2000: 361-372 |
| 1999 |
|---|
| 2 | | Dieter Kranzlmüller,
Jochen Messner,
Christian Schaubschläger:
"Good Enough" Testing of Nondeterministic Parallel Programs.
PDPTA 1999: 641-646 |
| 1998 |
|---|
| 1 | EE | Johannes Köbler,
Jochen Messner:
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets.
IEEE Conference on Computational Complexity 1998: 132-140 |
