| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:603832502:1778 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:603832502:1778?format=raw |
LEADER: 01778mam a2200349 a 4500
001 1972930
005 20220609041401.0
008 970408s1996 enka b 001 0 eng d
010 $agb 97021575
015 $aGB97-21575
020 $a1857284518 (HB)
035 $a(OCoLC)ocm36703810
035 $9AMH8415CU
035 $a1972930
040 $aGUA$cGUA$dUKM$dOrLoB-B
041 1 $aeng$hfre
082 04 $a511.8$221
100 1 $aBarthelemy, Jean-Pierre.$0http://id.loc.gov/authorities/names/n91032963
240 10 $aComplexité algorithmique et problèmes de communications.$lEnglish$0http://id.loc.gov/authorities/names/n97042487
245 10 $aAlgorithmic complexity and communication problems /$cJ.-P. Barthelemy, G. Cohen, A. Lobstein ; translated by Catherine Fritsch-Mignotte and Maurice Mignotte.
260 $aLondon :$bUCL Press,$c1996.
300 $axix, 256 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references (p. [241]-249) and index.
505 00 $gCh. I.$tProblems and languages --$gCh. II.$tMachines, languages and problems. Classes P and NP --$gCh. III.$tNP-hard problems and languages and complements to algorithmic complexity --$gCh. IV.$tComplexity and coding --$gCh. V.$tComplexity and cryptology --$gCh. VI.$tVector quantization.
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
650 0 $aNP-complete problems.$0http://id.loc.gov/authorities/subjects/sh88005054
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
700 1 $aCohen, G.$q(Gérard),$d1951-$0http://id.loc.gov/authorities/names/n87937476
700 1 $aLobstein, A.
852 00 $boff,eng$hQA267.7$i.B3713 1996g