|
" Randomized algorithms : "
Russ Bubley
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
665894
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Bubley, Russ,1974-
|
| Title & Author
|
:
|
Randomized algorithms : : approximation, generation, and counting /\ Russ Bubley
|
| Series Statement
|
:
|
Distinguished dissertations,
|
| Page. NO
|
:
|
xvi, 152 pages :: illustrations ;; 24 cm
|
| ISBN
|
:
|
1852333251
|
|
|
:
|
: 9781852333256
|
|
|
:
|
: 144711180X
|
|
|
:
|
: 9781447111801
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (pages 139-148) and index
|
| Contents
|
:
|
1. Mathematical Background -- 2. Techniques for Sampling and Approximate Sampling -- 3. Approximate Counting -- 4. Applications: Coupling -- Intermezzo: Path Coupling -- 5. Applications: Path Coupling -- 6. Directions for Future Work -- App. A. Application of Dobrushin's Uniqueness Criterion -- App. B. A Hierarchy of #SAT Restrictions -- App. C. Equivalence of Transposition Distance to Spearman's Footrule
|
| Subject
|
:
|
Markov processes
|
| Subject
|
:
|
Monte Carlo method
|
| Subject
|
:
|
Computational complexity
|
| Dewey Classification
|
:
|
519.2/33
|
| LC Classification
|
:
|
QA274.2.B82 2001
|
| |