| Record ID | ia:complexityrealco0000unse |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/complexityrealco0000unse/complexityrealco0000unse_marc.xml |
| Download MARC binary | https://www.archive.org/download/complexityrealco0000unse/complexityrealco0000unse_meta.mrc |
LEADER: 00965cam 2200301 a 4500
001 0116403976081
005 19980814121628.3
008 970522s1998 nyua b 001 0 eng
010 $a 97022859 //r98
020 $a0387982817 (hc : alk. paper)
020 $c39.95
035 $a(Sirsi) ACR-6071
035 00 $aMAT A99-863$fcc$iLCMARC/AVP-3621/PMARTIN
040 $aOPET$beng
046 $aDLC$cDLC$dDLC
050 00 $aQA76$b.C5474 1998
082 00 $a511.3$221
090 $aQA 76 .C555 1998$bb
245 00 $aComplexity and real computation /$cLenore Blum ... [et al.] ; foreword by Richard M. Karp.
260 $aNew York :$bSpringer,$cc1998.
300 $axvi, 453 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references (p. [431]-445) and index.
518 $a99 10 15
650 0 $aComputational complexity.
650 0 $aComputer algorithms.
650 0 $aComputer science.
650 0 $aReal-time data processing.
700 1 $aBlum, Lenore.