• DocumentCode
    2142756
  • Title

    A note on the hardness of tree isomorphism

  • Author

    Jenner, Birgit ; Mckenzie, Pierre ; Torán, Jacobo

  • Author_Institution
    Ulm Univ., Germany
  • fYear
    1998
  • fDate
    15-18 Jun 1998
  • Firstpage
    101
  • Lastpage
    105
  • Abstract
    We prove that the tree isomorphism problem, when trees are encoded as strings, is NC1-hard under DLOGTIME-reductions. NC1 -completeness thus follows from Buss´s recent NC1 upper bound. By contrast, we prove that testing isomorphism of two trees encoded as pointer lists is L-complete
  • Keywords
    computational complexity; formal languages; trees (mathematics); DLOGTIME-reductions; L-complete; NC1-completeness; NC1-hard; hardness; isomorphism; tree isomorphism; upper bound; Books; Circuits; Complexity theory; Computer science; Jacobian matrices; Polynomials; Testing; Tree graphs; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
  • Conference_Location
    Buffalo, NY
  • ISSN
    1093-0159
  • Print_ISBN
    0-8186-8395-3
  • Type

    conf

  • DOI
    10.1109/CCC.1998.694595
  • Filename
    694595
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2142756