| Record ID | marc_marygrove/marygrovecollegelibrary.full.D20191108.T213022.internetarchive2nd_REPACK.mrc:62400846:2597 |
| Source | Marygrove College |
| Download Link | /show-records/marc_marygrove/marygrovecollegelibrary.full.D20191108.T213022.internetarchive2nd_REPACK.mrc:62400846:2597?format=raw |
LEADER: 02597cam a2200673 i 4500
001 ocm01501927
003 OCoLC
005 20191109073347.6
008 750611s1975 nyu b 001 0 eng
010 $a 74021786
040 $aDLC$beng$cDLC$dUKM$dMUQ$dOCLCQ$dNLGGC$dYDXCP$dOCLCG$dSYB$dNLE$dDEBBG$dOG#$dBDX$dGBVCP$dOCLCO$dOCLCF$dOCLCQ$dOCLCO$dOCLCQ$dCSJ$dOCLCO$dOCLCQ$dCPO$dOCLCO$dOCLCQ$dOCLCO$dEUQ$dDCHUA$dOCLCQ
015 $aGB7606644$2bnb
016 7 $aB7602214$2bccb
019 $a16284001$a1064832024$a1078813977$a1080675524$a1083400788$a1086757075$a1087439105
020 $a0444001689
020 $a9780444001689
020 $a0444001565$q(pbk.)
020 $a9780444001566$q(pbk.)
029 1 $aAU@$b000000451182
029 1 $aAU@$b000012427995
029 1 $aAU@$b000027526577
029 1 $aDEBBG$bBV001963396
029 1 $aDEBBG$bBV022047476
029 1 $aDEBSZ$b008509948
029 1 $aGBVCP$b020682999
029 1 $aHEBIS$b046188339
029 1 $aNZ1$b2954394
035 $a(OCoLC)01501927$z(OCoLC)16284001$z(OCoLC)1064832024$z(OCoLC)1078813977$z(OCoLC)1080675524$z(OCoLC)1083400788$z(OCoLC)1086757075$z(OCoLC)1087439105
050 00 $aQA76$b.B65
082 0 $a519.7
082 00 $a519.4$218
084 $a31.11$2bcl
084 $a54.10$2bcl
084 $aSK 910$2rvk
084 $aSK 900$2rvk
049 $aMAIN
100 1 $aBorodin, Allan.
245 14 $aThe computational complexity of algebraic and numeric problems /$cA. Borodin, I. Munro.
260 $aNew York :$bAmerican Elsevier Pub. Co.,$c[1975]
300 $a174 pages ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aTheory Of Computation Series. 1
504 $aIncludes bibliographical references (pages 163-172) and index.
590 $bInternet Archive - 2
590 $bInternet Archive 2
650 0 $aComputational complexity.
650 6 $aComplexité de calcul (Informatique)
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aRekursivität$2gnd
653 $aComputational complexity
700 1 $aMunro, I.$q(Ian),$d1947-$eauthor.
776 08 $iOnline version:$aBorodin, Allan.$tComputational complexity of algebraic and numeric problems.$dNew York : American Elsevier Pub. Co., [1975]$w(OCoLC)643689885
830 0 $aElsevier computer science library.$pTheory of computation series ;$v1.
938 $aBrodart$bBROD$n27453294$c$8.75
938 $aYBP Library Services$bYANK$n394070
994 $a92$bERR
976 $a31927001218707