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

by Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2004   p90-99

Archived Files and Locations

application/pdf  246.7 kB
file_ne7r2vl7mzhknlclitu3xxnvlu
web.archive.org (webarchive)
www.cs.rpi.edu (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
www.cs.rpi.edu (web)
+ 1 more URLs
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2004
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 993997d3-1f94-4a6e-b6f5-bac1c2221b05
API URL: JSON