| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Uwe Schöning, Jacobo Torán |
Das Erfüllbarkeitsproblem SAT - Algorithmen und Analysen.  |
|
2012 |
RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. |
TOCT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner |
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bireswar Das, Jacobo Torán, Fabian Wagner |
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Reductions to Graph Isomorphism. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Jacobo Torán, Fabian Wagner |
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner |
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Jacobo Torán, Fabian Wagner |
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán, Fabian Wagner |
The Complexity of Planar Graph Isomorphism. |
Bulletin of the EATCS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Reductions to Graph Isomorphism. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Reductions to Graph Isomorphism. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, reducibilities, graph isomorphism |
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Schöning, Jacobo Torán |
A note on the size of Craig Interpolants. |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Isomorphism Testing: Perspective and Open Problems. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Arthur-Merlin Games and the Problem of Isomorphism Testing. |
CiE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism is (almost) in NP\cap coNP |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Space and Width in Propositional Resolution (Column: Computational Complexity). |
Bulletin of the EATCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
On the Hardness of Graph Isomorphism. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Luis Esteban, Jacobo Torán |
A combinatorial characterization of treelike resolution space. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Luis Esteban, Jacobo Torán |
A Combinatorial Characterization of Treelike Resolution Space |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Jochen Messner, Jacobo Torán |
Optimal proof systems imply complete sets for promise classes. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Completeness results for graph isomorphism. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Jacobo Torán |
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
A nonadaptive NC checker for permutation group intersection. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Luis Esteban, Jacobo Torán |
Space Bounds for Resolution. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Baumer, Juan Luis Esteban, Jacobo Torán |
Minimally Unsatisfiable CNF Formulas. |
Bulletin of the EATCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán |
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
On the Hardness of Graph Isomorphism. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
logarithmic space many-one reductions, probabilistic logarithmic space, hardness results, randomized logarithmic space reduction, computational complexity, graph theory, encoding, determinant, graph isomorphism, perfect matching, complexity classes, hardness |
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán |
On Finding the Number of Graph Automorphisms. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Juan Luis Esteban, Jacobo Torán |
Space Bounds for Resolution. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
Lower Bounds for Space in Resolution. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Resolution, space, complexity measures, pebbling game |
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jochen Meßner, Jacobo Torán |
Optimal Proof Systems for Propositional Logic and Complete Sets. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Jacobo Torán |
A Note on the Hardness of Tree Isomorphism. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Meßner, Jacobo Torán |
Optimal proof systems for Propositional Logic and complete sets |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán |
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
A Nonadaptive NC Checker for Permutation Group Intersection. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
nonadaptive queries, permutation groups, Program checking |
| 1 | Josep Díaz, Maria J. Serna, Jacobo Torán |
Parallel Approximation Schemes for Problems on Planar Graphs. |
Acta Inf. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Jacobo Torán |
Computing Functions with Parallel Queries to NP. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán |
The Power of the Middle Bit of a #P Function. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán |
Efficient Parallel Algorithms for some Tree Layout Problems. |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Chang, William I. Gasarch, Jacobo Torán |
On Finding the Number of Graph Automorphisms. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Josep Díaz, Maria J. Serna, Jacobo Torán |
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Jacobo Torán |
Computing Functions with Parallel Queries to NP. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Jacobo Torán |
Graph Isomorphism is Low for PP. |
Computational Complexity |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán |
Turing Machines with Few Accepting Computations and Low Sets for PP. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Jacobo Torán |
Graph Isomorphism is Low for PP. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoni Lozano, Jacobo Torán |
On the Non-Uniform Complexity of the Graph Isomorphism Problem. |
Complexity Theory: Current Research |
1992 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green, Johannes Köbler, Jacobo Torán |
The Power of the Middle Bit. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Antoni Lozano, Jacobo Torán |
On the Nonuniform Complexity on the Graph Isomorphism Problem. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Jacobo Torán |
Complexity Classes Defined by Counting Quantifiers. |
J. ACM |
1991 |
DBLP DOI BibTeX RDF |
counting complexity classes |
| 1 | Antoni Lozano, Jacobo Torán |
Self-Reducible Sets of Small Sensity. |
Mathematical Systems Theory |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán |
The MINSUMCUT Problem. |
WADS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Jacobo Torán |
Classes of Bounded Nondeterminism. |
Mathematical Systems Theory |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
Counting the Number of Solutions. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Jacobo Torán |
On Counting and Approximation. |
Acta Inf. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
A Combinatorial Technique for Separating Counting Complexity Classes. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Josep Díaz, Jacobo Torán |
Complexity Classes with Complete Problems Between P and NP-C. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán |
Turing Machines with few Accepting Computations and low Sets for PP. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Uwe Schöning, Jacobo Torán |
On Counting and Approximation. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
Succinct Representations of Counting Problems. |
AAECC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán |
On The Complexity of Computable Real Sequences. |
ITA |
1987 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")