| Record ID | OpenLibraries-Trent-MARCs/tier5.mrc:43396546:1056 |
| Source | OpenLibraries-Trent-MARCs |
| Download Link | /show-records/OpenLibraries-Trent-MARCs/tier5.mrc:43396546:1056?format=raw |
LEADER: 01056cam 2200301 a 4500
001 0116404317384
005 19930429074242.3
008 930203s1993 maua b 001 0 eng
010 $a 93022011
020 $c43.50
035 $a(Sirsi) ACO-3230
035 00 $a0817636803 (acid-free) ;$iLCMARC/AQS-6415/BLCAT1
040 $aMAT A97-3246$fcc$aDLC$cDLC$dDLC
040 $aOPET$beng
050 00 $aQA267.7$b.K63 1993
090 $aQA 267.7 .K63 1993$bb
100 1 $aKöbler, Johannes,$d1958-
245 14 $aThe graph isomorphism problem :$bits structural complexity /$cJohannes Köbler, Uwe Schöning, Jacobo Torán.
260 $aBoston :$bBirkhäuser,$cc1993.
300 $a160 p. :$bill. ;$c25 cm.
440 0 $aProgress in theoretical computer science.
504 $aIncludes bibliographical references (p. [149]-157) and index.
518 $a98 02 24
650 0 $aComputational complexity.
650 0 $aGraph theory$xData processing.
650 0 $aIsomorphisms (Mathematics)
700 10 $aSchöning, Uwe,$d1955-
700 10 $aTorán, Jacobo,$d1962-