| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:59766175:1283 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:59766175:1283?format=raw |
LEADER: 01283pam a2200349 i 4500
001 1543161
005 20220608184442.0
008 750611s1975 nyu b 001 0 eng
010 $a 74021786
015 $aGB76-6644
020 $a0444001689
020 $a0444001565 (pbk.)
035 $a(OCoLC)ocm01501927
035 $9AKC4994CU
035 $a(NNC)1543161
035 $a1543161
040 $aDLC$cDLC$dUKM$dZCU
050 00 $aQA76$b.B65
082 0 $a519.7
100 1 $aBorodin, Allan,$d1941-$0http://id.loc.gov/authorities/names/n97099041
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
500 $a"Elsevier computer science library. Theory of computation series ; 1."
504 $aBibliography: p. 163-172.
500 $aIncludes index.
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
653 $aComputational complexity
700 1 $aMunro, I.$q(Ian),$d1947-$eauthor.$4http://id.loc.gov/vocabulary/relators/aut$0http://id.loc.gov/authorities/names/no2003105613
852 00 $boff,eng$hQA76$i.B65