Mendeley出力
＜図書＞
Algorithms for random generation and counting : a Markov chain approach
| 責任表示 | Alistair Sinclair |
|---|---|
| シリーズ | Progress in theoretical computer science |
| データ種別 | 図書 |
| 出版情報 | Boston : Birkhäuser , c1993 |
| 本文言語 | 英語 |
| 大きさ | 146 p. ; 25 cm |
| 概要 | A study of two classical computational problems that not only amuse mathematicians, but also arise in the natural sciences: counting the elements of a finite set of combinatorial structures; and gener...ting them at random from some probability distribution. Of interest to researchers and graduate students in theoretical computer science who are working with probability and statistics. Annotation copyright by Book News, Inc., Portland, OR続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図1F 開架 | 417.1/Si 8 | 1993 |
|
068252193005953 |
|
書誌詳細
| 一般注記 | Rev. version of the author's thesis (Ph. D.)--University of Edinburgh, 1988 Includes bibliographical references (p. 136-143) and index |
|---|---|
| 著者標目 | *Sinclair, Alistair, 1960- |
| 件 名 | LCSH:Markov processes LCSH:Combinatorial set theory LCSH:Algorithms |
| 分 類 | LCC:QA274.7 DC20:519.2/33 |
| 書誌ID | 1001046882 |
| ISBN | 0817636587 |
| NCID | BA19822869 |
| 巻冊次 | :us ; ISBN:0817636587 :gw ; ISBN:3764336587 |
| 登録日 | 2009.09.17 |
| 更新日 | 2009.09.17 |