A note on the hardness of tree isomorphism

@article{Jenner1998ANO,
  title={A note on the hardness of tree isomorphism},
  author={Birgit Jenner and Pierre McKenzie and Jacobo Tor{\'a}n},
  journal={Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)},
  year={1998},
  pages={101-105}
}
We prove that the tree isomorphism problem, when trees are encoded as strings, is NC/sup 1/-hard under DLOGTIME-reductions. NC/sup 1/-completeness thus follows from Buss's recent NC/sup 1/ upper bound. By contrast, we prove that testing isomorphism of two trees encoded as pointer lists is L-complete. 

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

A Logspace Algorithm for Tree Canonization

  • STOC 1992
  • 1992
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization

  • Kurt Gödel Colloquium
  • 1997
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Counting quantifiers, successor relations, and logarithmic space

  • Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Parallel Tree Contraction, Part 2: Further Applications

  • SIAM J. Comput.
  • 1991
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Between NC 1 and NC 2: Classi cation of Problems by Logspace Resources

B. Jenner
  • Manuskript of Habilitation thesis,
  • 1998
VIEW 1 EXCERPT

On the nonuniform complexity of the Graph Isomorphism problem

A. Lozano, J. Tor an
  • Complexity Theory: Current Research,
  • 1993
VIEW 1 EXCERPT