The Complexity of Finding Top-Toda-Equivalence-Class Members

Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand. The Complexity of Finding Top-Toda-Equivalence-Class Members. In Martin Farach-Colton, editor, LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Volume 2976 of Lecture Notes in Computer Science, pages 90-99, Springer, 2004. [doi]

@inproceedings{HemaspaandraOZZ04,
  title = {The Complexity of Finding Top-Toda-Equivalence-Class Members},
  author = {Lane A. Hemaspaandra and Mitsunori Ogihara and Mohammed Javeed Zaki and Marius Zimand},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2976&spage=90},
  researchr = {https://researchr.org/publication/HemaspaandraOZZ04},
  cites = {0},
  citedby = {0},
  pages = {90-99},
  booktitle = {LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
  editor = {Martin Farach-Colton},
  volume = {2976},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-21258-2},
}