The Complexity of Polynomial-Time Approximation release_z7x76ylombhy5i2zj5em4gt6se

by Liming Cai, Michael Fellows, David Juedes, Frances Rosamond

Published in Theory of Computing Systems by Springer Nature.

2007   Volume 41, p459-477

Archived Files and Locations

application/pdf  370.2 kB
file_j4yybgo3frhnriqq3o4anmomw4
cobweb.cs.uga.edu (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Year   2007
Language   en ?
Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  1432-4350
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f874b9bf-c31c-4488-97a3-a452fdc26041
API URL: JSON