Johannes Köbler (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

67 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)

52 Johannes Köbler, Jochen Messner, Jacobo Torán: Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003)

44 Johannes Köbler, Jochen Messner: Is the Standard Proof System for SAT P-Optimal? FSTTCS 2000: 361-372

38 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

Selection of 4 from 83 records - Johannes Köbler has 32 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

67		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)
52		Johannes Köbler, Jochen Messner, Jacobo Torán: Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003)
44		Johannes Köbler, Jochen Messner: Is the Standard Proof System for SAT P-Optimal? FSTTCS 2000: 361-372
38		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