| Record ID | ia:algorithmsforran0000sinc |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/algorithmsforran0000sinc/algorithmsforran0000sinc_marc.xml |
| Download MARC binary | https://www.archive.org/download/algorithmsforran0000sinc/algorithmsforran0000sinc_meta.mrc |
LEADER: 00923pam a2200265 a 4500
001 92034616
003 DLC
005 19930104140642.7
008 921006s1993 mau b 001 0 eng
010 $a 92034616
020 $a0817636587 (acid-free)
020 $a3764336587 (Basel : acid-free)
040 $aDLC$cDLC$dDLC
050 00 $aQA274.7$b.S56 1993
082 00 $a519.2/33$220
100 1 $aSinclair, Alistair,$d1960-
245 10 $aAlgorithms for random generation and counting :$ba Markov chain approach /$cAlistair Sinclair.
260 $aBoston :$bBirkhäuser,$cc1993.
300 $a146 p. ;$c25 cm.
440 0 $aProgress in theoretical computer science
500 $aRev. version of the author's thesis (Ph. D.)--University of Edinburgh, 1988.
504 $aIncludes bibliographical references (p. 136-143) and index.
650 0 $aMarkov processes.
650 0 $aCombinatorial set theory.
650 0 $aAlgorithms.