Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
The Graph Isomorphism Problem: Its Structural Complexity
- J. Köbler, U. Schöning, J. Torán
- Mathematics
- 1 July 1993
Introduction Preliminaries Decision Problems, Search Problems, and Counting Problems NP-Completeness The Classes P and NP Reducibility. Reducing the Construction Problem to the Decision Problem… Expand
Optimal proof systems imply complete sets for promise classes
- J. Köbler, J. Messner, J. Torán
- Mathematics, Computer Science
- Inf. Comput.
- 10 July 2003
TLDR
On pseudorandomness and resource-bounded measure
TLDR
New Collapse Consequences of NP Having Small Circuits
- J. Köbler, O. Watanabe
- Mathematics, Computer Science
- ICALP
- 10 July 1995
TLDR
New Collapse Consequences of NP Having Small Circuits
- J. Köbler, O. Watanabe
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 February 1999
TLDR
On counting and approximation
- J. Köbler, U. Schöning, J. Torán
- Computer Science
- Acta Informatica
- 2004
TLDR
Completeness results for graph isomorphism
- B. Jenner, J. Köbler, P. McKenzie, J. Torán
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1 May 2003
TLDR
Is the Standard Proof System for SAT P-Optimal?
- J. Köbler, J. Messner
- Mathematics, Computer Science
- FSTTCS
- 13 December 2000
TLDR
The Difference and Truth-Table Hierarchies for NP
- J. Köbler, U. Schöning, K. Wagner
- Mathematics, Computer Science
- RAIRO Theor. Informatics Appl.
- 1987
Definition de deux hierarchies des classes de complexite. Localisation de la hierarchie de differences et de la hierarchie du tableau de verite pour NP. Exemples d'ensembles complets dans les deux… Expand
Complexity-Restricted Advice Functions
- J. Köbler, T. Thierauf
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 April 1994
TLDR