Jacobo Toran
Jacobo Toran
Professor for theoretical computer science, University of Ulm
Adresse e-mail validée de uni-ulm.de
Titre
Citée par
Citée par
Année
The graph isomorphism problem: its structural complexity
J Kobler, U Schöning, J Torán
Springer Science & Business Media, 2012
6502012
On the hardness of graph isomorphism
J Torán
SIAM Journal on Computing 33 (5), 1093-1108, 2004
1572004
On the hardness of Graph Isomorphism
J Toran
FOCS, 180--183, 2000
157*2000
Complexity classes defined by counting quantifiers
J Torán
Journal of the ACM (JACM) 38 (3), 752-773, 1991
1411991
Space bounds for resolution
JL Esteban, J Torán
Information and Computation 171 (1), 84-97, 2001
1222001
Turing machines with few accepting computations and low sets for PP
J Kobler, U Schöning, S Toda, J Torán
Journal of Computer and System Sciences 44 (2), 272-286, 1992
1001992
On counting and approximation
J Köbler, U Schöning, J Torán
Acta Informatica 26 (4), 363-379, 1989
911989
Graph isomorphism is low for PP
J Köbler, U Schöning, J Torán
Computational Complexity 2 (4), 301-330, 1992
821992
Completeness results for graph isomorphism
B Jenner, J Köbler, P McKenzie, J Torán
Journal of Computer and System Sciences 66 (3), 549-566, 2003
762003
The complexity of algorithmic problems on succinct instances
JL Balcázar, A Lozano, J Torán
Computer Science, 351-377, 1992
711992
Computing functions with parallel queries to NP
B Jenner, J Torán
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993
671993
Structural properties of the counting hierarchies
J Toran
Ph. D. Thesis, 1988
661988
Isomorphism testing: Perspective and open problems
V Arvind, J Torán
602005
Classes of bounded nondeterminism
J Diaz, J Torán
Mathematical Systems Theory 23 (1), 21-32, 1990
601990
Optimal proof systems imply complete sets for promise classes
J Köbler, J Messner, J Torán
Information and Computation 184 (1), 71-92, 2003
562003
The power of the middle bit of a# P function
F Green, J Kobler, KW Regan, T Schwentick, J Torán
Journal of Computer and System Sciences 50 (3), 456-467, 1995
511995
An oracle characterization of the counting hierarchy
J Toràn
1988 Structure in Complexity Theory Third Annual Conference, 213,214,215,216 …, 1988
411988
On the Non-Uniform Complexity of the Graph Isomorphism Problem.
A Lozano, J Torán
Complexity Theory: Current Research, 245-271, 1992
371992
A combinatorial characterization of treelike resolution space
JL Esteban, J Torán
Information Processing Letters 87 (6), 295-300, 2003
362003
Solvable Group Isomorphism Is (Almost) in NP∩ coNP
V Arvind, J Torán
ACM Transactions on Computation Theory (TOCT) 2 (2), 4, 2011
33*2011
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20