Algorithms for random generation & counting : a Markov chain approach
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boston :
Birkhauser,
c1993
|
| Series: | Progress in theoretical computer science
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 1/49215 | ||
| 008 | 070725s1993 eng d | ||
| 020 | |a 0-8176-3658-7 | ||
| 035 | |l 10089127 | ||
| 040 | |a GR-MY-UA |b gre |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 519.233 |2 (20) | |
| 100 | 1 | |a Sinclair, Alistair |d 1960- | |
| 245 | 1 | 0 | |a Algorithms for random generation & counting : |b a Markov chain approach / |c Alistair Sinclair |
| 260 | |a Boston : |b Birkhauser, |c c1993 | ||
| 300 | |a 146 σ.; |c 25 εκ. | ||
| 490 | 1 | |a Progress in theoretical computer science | |
| 500 | |a Rev. version of the author's thesis (Ph. D.)--University of Edinburgh,1988. | ||
| 504 | |a Περιλαμβάνει βιβλιογραφικές παραπομπές(σ. 136-143) και ευρετήριο | ||
| 650 | 0 | 0 | |a Markov processes. |
| 650 | 0 | 0 | |a Combinatorial set theory. |
| 650 | 0 | 0 | |a Algorithms. |
| 830 | 0 | |a Progress in theoretical computer science | |
| 852 | |a INST |b SAMOS |e 20070725 |h 519.233 SIN |p 005300025808 |q 005300025808 |t BK |y 0 | ||
| 901 | |a BIBL3-2007-2 | ||
| 909 | |a Σ |b 135794 | ||
| 922 | |a 3ΕΛΗ |b 200706 |c ΕΠΕΑΕΚ2/ΤΣΑΕ |d ΕΛΕΥΘΕΡΟΥΔΑΚΗΣ | ||
| 970 | |a ΚΟΣΙΕΡΗΣ |b ΧΡΗΣΤΟΣ |z 2007/07/25 | ||