000 01287n a2200361#a 4500
001 30520
005 20240404163614.0
008 921006s1993 mau b 001 0 eng||
010 _a92034616
020 _a0817636587 (acid-free)
020 _a3764336587 (Basel : acid-free)
035 _a(OCoLC
040 _aDLC
_cDLC
_dFPU
082 0 0 _a519.233
_bS616a
090 _ama2A
100 1 _aSinclair, Alistair
_d1960-
_916387
245 1 0 _aAlgorithms for random generation and counting:
_ba Markov chain approach/
_cAlistair Sinclair.
260 _aBoston:
_bBirkhäuser,
_cc1993.
300 _a146 p.;
_c25 cm.
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 7 _aMarkov, processus de.
_2ram
_927617
650 0 7 _aEnsembles, théorie combinatoire des.
_2ram
_916388
650 0 7 _aAlgorithmes.
_2ram
_928687
650 0 0 _aMarkov processes.
_943599
650 0 0 _aCombinatorial set theory.
_937401
650 0 0 _aAlgorithms.
_937032
697 _aMatemática Aplicada 02A-
_xProcessos Estocásticos.
_923741
942 _2impa
_cBK
949 _a200633619
999 _c29564
_d29564
490 0 _aProgress in theoretical computer science
_935559