Birgit Jenner, Johannes Köbler, et al.  Home/Search
Context Related
| samy.informatik.huberl...compgi.ps.gz theorie.informatik.uni...completeiso.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: samy.informatik.h...publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC . In particular we show that tree isomorphism, when trees are encoded as strings, is NC -hard under AC -reductions. NC -completeness thus follows from Buss's NC upper bound. By contrast, we prove that testing isomorphism of two trees encoded as pointer lists is L-complete. Concerning colored... (Update)
Cited by: More
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic - Nijjar (2004) (Correct)
Similar documents (at the sentence level):
39.2%: The Complexity of Graph Isomorphism for Colored Graphs.. - Köbler, Torán (Correct)
13.6%: A Note on the Hardness of Tree Isomorphism - Jenner, McKenzie, Torán (1998) (Correct)
Active bibliography (related documents): More All
0.9: On the Hardness of Graph Isomorphism - Torán (2000) (Correct)
0.5: Searching constant width mazes captures the AC0 hierarchy - Barrington, Lu, Miltersen, .. (1998) (Correct)
0.4: On the Parallel Complexity of Tree Automata - Lohrey (2001) (Correct)
Similar documents based on text: More All
0.7: Tree Isomorphism and Some Other Complete Problems for.. - Jenner, Lange, McKenzie (1997) (Correct)
0.5: On Finding the Number of Graph Automorphisms - Robert Beals, Richard Chang.. (1996) (Correct)
0.4: Logspace and Logtime Leaf Languages - Jenner, McKenzie, Thérien (1996) (Correct)
BibTeX entry: (Update)
Birgit Jenner, Johannes K obler, Pierre McKenzie, and Jacobo Tor an. Completeness results for graph isomorphism. Journal of Computer and Ststem Sciences (JCSS), 66:549--566, 2003. http://citeseer.ist.psu.edu/jenner02completeness.html More
@misc{ jenner03completeness,
author = "B. Jenner and J. obler and P. McKenzie and J. an",
title = "Completeness results for graph isomorphism",
text = "Birgit Jenner, Johannes K obler, Pierre McKenzie, and Jacobo Tor an. Completeness
results for graph isomorphism. Journal of Computer and Ststem Sciences (JCSS),
66:549--566, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/jenner02completeness.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
114 Bounded-width polynomial-size branching programs recognize e.. (context) - Barrington - 1989
98 An optimal lower bound for the number of variables for graph.. - Cai, urer et al. - 1992
70 The boolean formula value problem is in ALOGTIME - Buss - 1987
54 and logarithmic space (context) - Etessami, ers et al. - 1995
43 Symmetric space-bounded computation (context) - Lewis, Papadimitriou - 1982
39 Polynomial time algorithms for permutation groups (context) - Furst, Hopcroft et al. - 1980
29 Problems complete for deterministic logarithmic space (context) - Cook, McKenzie - 1987
25 Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
22 The Graph Isomorphism Problem: Its Structural Complexity (context) - obler, Sch et al. - 1993
16 Moderately exponential bounds for graph isomorphism (context) - Babai - 1981
15 Monte Carlo algorithms for graph isomorphism testing (context) - Babai - 1979
14 Describing graphs: a rst order approach to graph canonizatio.. (context) - Immerman, Lander - 1990
14 On computing boolean connectives of characteristic functions (context) - Chang, Kadin - 1995
13 the nonuniform complexity of the graph isomorphism problem (context) - Lozano, Tor et al. - 1993
10 A logspace algorithm for tree canonization (context) - Lindell - 1992
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
8 Parallel tree contraction part 2: Further applications (context) - Miller, Reif - 1991
7 A compendium of problems complete for symmetric logarithmic .. - Alvarez, Greenlaw - 2000
7 the hardness of graph isomorphism - Tor, On - 2000
6 Parallel algorithms for permutation groups and graph isomorp.. (context) - Luks - 1986
6 Alogtime algorithms for tree isomorphism (context) - Buss - 1997
4 A note on the hardness of tree isomorphism - Jenner, McKenzie et al. - 1998
4 matrices and nonassociative computation (context) - Beaudry, McKenzie - 1995
2 On uniformity within NC Journal of Computer and System Scien.. (context) - Barrington, Immerman et al. - 1990
1 The complexity of graph isomorphism for colored graphs with .. (context) - obler, Tor - 2002
Documents on the same site (http://samy.informatik.hu-berlin.de/Institut/struktur/algorithmenII/publikationen.html): More
Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (2000) (Correct)
On Distribution-Specific Learning With Membership Queries.. - Köbler, Lindner (Correct)
Is the Standard Proof System for SAT P-optimal? (Extended.. - Köbler, Messner (Correct)
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