Παρακολούθηση
Jacobo Toran
Jacobo Toran
Professor for theoretical computer science, University of Ulm
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα uni-ulm.de
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
The graph isomorphism problem: its structural complexity
J Kobler, U Schöning, J Torán
Springer Science & Business Media, 2012
7352012
On the hardness of Graph Isomorphism
J Toran
FOCS, 180--183, 2000
185*2000
Complexity classes defined by counting quantifiers
J Torán
Journal of the ACM (JACM) 38 (3), 752-773, 1991
1521991
Space bounds for resolution
JL Esteban, J Torán
Information and Computation 171 (1), 84-97, 2001
1382001
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
1071992
On counting and approximation
J Köbler, U Schöning, J Torán
Acta Informatica 26 (4), 363-379, 1989
981989
Graph isomorphism is low for PP
J Köbler, U Schöning, J Torán
Computational Complexity 2, 301-330, 1992
941992
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
852003
The complexity of algorithmic problems on succinct instances
JL Balcázar, A Lozano, J Torán
Computer science: research and applications, 351-377, 1992
821992
Computing functions with parallel queries to NP
B Jenner, J Torán
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993
731993
Structural properties of the counting hierarchies
J Torán
Universitat Politècnica de Catalunya, Barcelona, Spain, 1988
701988
Isomorphism testing: Perspective and open problems
V Arvind, J Torán
682005
Classes of bounded nondeterminism
J Diaz, J Torán
Mathematical Systems Theory 23 (1), 21-32, 1990
661990
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
652003
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
531995
An oracle characterization of the counting hierarchy
J Toràn
1988 Structure in Complexity Theory Third Annual Conference, 213,214,215,216 …, 1988
471988
The Satisfiability Problem: Algorithms and Analyses
U Schöning, J Toran
The Satisfiability Problem: Algorithms and Analyses, 184, 2013
462013
On the Non-Uniform Complexity of the Graph Isomorphism Problem.
A Lozano, J Torán
Complexity Theory: Current Research, 245-271, 1992
401992
A combinatorial characterization of treelike resolution space
JL Esteban, J Torán
Information Processing Letters 87 (6), 295-300, 2003
392003
Space bounds for resolution
JL Esteban, J Torán
Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999
361999
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20