<図書>
Extremal combinatorics : with applications in computer science
| 責任表示 | Stasys Jukna |
|---|---|
| シリーズ | Texts in theoretical computer science ; An EATCS series |
| データ種別 | 図書 |
| 出版情報 | Berlin ; New York : Springer , c2001 |
| 本文言語 | 英語 |
| 大きさ | xvii, 375 p. : ill. ; 24 cm |
| 概要 | This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the ...ems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods. 続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図3F 数理独自 | JUKN/10/1 | 2001 |
|
023212001003778 |
|
書誌詳細
| 一般注記 | Includes bibliographical references (p. [353]-366) and indexes |
|---|---|
| 著者標目 | *Jukna, Stasys, 1953- |
| 件 名 | LCSH:Combinatorial analysis LCSH:Extremal problems (Mathematics) |
| 分 類 | LCC:QA164 DC21:511/.6 |
| 書誌ID | 1001397804 |
| ISBN | 3540663134 |
| NCID | BA52468701 |
| 巻冊次 | ISBN:3540663134 |
| 登録日 | 2009.11.02 |
| 更新日 | 2009.11.02 |
Mendeley出力