Jacobo Torán  Home/Search
Context Related
| theorie.informatik.uniulm.de...hard.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: theorie.informatik.uniulm.de/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class Mod k L and for the class DET of problems NC 1 reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism. 1. Introduction The... (Update)
Context of citations to this paper: More
...that the isomorphism problem for trees is hard for NC and for L (logarithmic space) depending on the encoding of the input. Moreover in [17] it was proved that isomorphism for general graphs is hard for NL (nondeterministic logarithmic space) and for every logarithmic space...
Cited by: More
Privacy Problems with Anonymized Transaction Databases - Taneli Mielikainen Hiit (Correct)
Equivalence Problems for Boolean Constraint Satisfaction - Böhler, Hemaspaandra.. (2001) (Correct)
A Fixed-Point Logic with Symmetric Choice - Anuj Dawar And (Correct)
Active bibliography (related documents): More All
0.9: Completeness results for Graph Isomorphism - Jenner, Köbler, al. (2002) (Correct)
0.9: The Complexity of Graph Isomorphism for Colored Graphs.. - Köbler, Torán (Correct)
0.5: Arithmetic Complexity, Kleene Closure, and Formal Power.. - Allender, Arvind, Mahajan (2003) (Correct)
Similar documents based on text: More All
0.4: The Computational Complexity - Column By Dept (Correct)
0.2: Space Bounds for Resolution - Esteban, Torán (1999) (Correct)
0.2: On Finding the Number of Graph Automorphisms - Robert Beals, Richard Chang.. (1996) (Correct)
Related documents from co-citation: More All
3: An optimal lower bound on the number of variables for graph identification - Cai, Furer et al. - 1992
3: Describing graphs: a rst-order approach to graph canonization (context) - Immerman, Lander - 1990
2: Featurebasierte Lokalisation eines autonomen mobilen Roboters (context) - Kluge, Schafer - 1999
BibTeX entry: (Update)
J. Toran. On the hardness of graph isomorphism. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), pp. 180--186 (2000). http://citeseer.ist.psu.edu/420874.html More
@misc{ toran00hardness,
author = "J. Toran",
title = "the hardness of graph isomorphism",
text = "J. Toran. On the hardness of graph isomorphism. In Proc. 41st Annual Symposium
on Foundations of Computer Science (FOCS), pp. 180--186 (2000).",
year = "2000",
url = "citeseer.ist.psu.edu/420874.html" }
Citations (may not include all citations):170 Nondeterministic space is closed under complement - Immerman - 1988
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
73 Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
69 requires exponential circuits: Derandomizing the XOR lemma (context) - Impagliazzo, Wigderson et al. - 1997
52 A very hard logspace counting class (context) - Alvarez, Jenner - 1993
44 The Graph Isomorphism Problem --- Its Structural Complexity (context) - Kobler, Schoning et al. - 1993
43 Symmetric space-bounded computation (context) - Lewis, Papadimitriou - 1982
41 Constructing a perfect matching is in random NC (context) - Karp, Upfal et al. - 1986
32 Space bounded hierarchies and probabilistic computations (context) - Ruzzo, Simon et al. - 1984
26 Canonical labeling of graphs (context) - Babai, Luks - 1983
26 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcsenyi - 1988
25 Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
23 Structure and importance of logspace-MOD-classes - Buntrock, Damm et al. - 1992
21 A note on the graph isomorphism counting problem (context) - Mathon - 1979
19 Superpolynomial lower bounds for monotone span programs - Babai, Gal et al. - 1999
17 Graph isomorphism is in the low hierarchy (context) - Schoning - 1988
12 RAIRO Theoretical Information and Applications (context) - Allender, Ogihara et al. - 1996
10 A logspace algorithm for tree canonization (context) - Lindell - 1992
9 Uniform circuits for division: consequences and problems - Allender, Barrington - 2000
9 algorithm for determining isomorphism of planar graphs (context) - Hopcroft, Tarjan - 1971
9 Isomorphism of bounded valence can be tested in polynomial t.. (context) - Luks - 1982
6 Parallel algorithms for permutation groups and graph isomorp.. (context) - Luks - 1986
6 Alogtime algorithms for tree isomorphism (context) - Buss - 1997
6 Isomorphism of graphs with bounded eigenvalue multiplicity (context) - Babai, Grigoryev et al. - 1982
4 A note on the hardness of tree isomorphism - Jenner, McKenzie et al. - 1998
2 The parallel complexity of Abelian permutation group problem.. (context) - McKenzie, Cook - 1987
2 matching and counting: uniform and nonuniform upper bounds (context) - Allender, Rheinhardt et al. - 2000
2 Preliminary version (context) - Chiu, Davida et al.
1 Graph isomorphism has subexponential size proofs unless PH c.. (context) - Klivans, van Melkebeek - 1999
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC