Mendeley出力
＜図書＞
Computational complexity theory
| 責任表示 | Steven Rudich, Avi Wigderson, editors |
|---|---|
| シリーズ | IAS/Park City mathematics series / [Dan Freed, series editor] ; v. 10 |
| データ種別 | 図書 |
| 出版情報 | Providence, R.I. : American Mathematical Society , c2004 |
| 本文言語 | 英語 |
| 大きさ | xiv, 389 p. : ill. ; 27 cm |
| 概要 | Computational complexity theory sets the formal mathematical foundations of efficient computation, asking which tasks can be performed given the limitations of computational resources. The field has e...panded to include mathematical disciplines, natural and physical sciences, and social sciences such as economics. This volume came from a Park City summer program through the Institute for Advanced Study, and covers its three weeks of lectures. Topics include complexity theory (the discipline from Godel to Feynman, average case complexity, exploring complexity through reductions, and quantum computation), lower bounds (circuit and communication complexity and proof complexity) and randomness in computation (pseudo-randomness and probabilistic proof systems). Presenters include bibliographies with their groups of lectures, but this volume does not include an index. Annotation ©2004 Book News, Inc., Portland, OR (booknews.com) 続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
: hardcover | 理系図3F 数理独自 | P 004/COMP/1 | 2004 |
|
023212004007275 |
|
書誌詳細
| 一般注記 | "Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000" -- T.p. verso Includes bibliographical references |
|---|---|
| 著者標目 | Rudich, Steven Wigderson, Avi |
| 件 名 | LCSH:Computational complexity |
| 分 類 | LCC:QA267.7 DC22:511.3/52 |
| 書誌ID | 1001397444 |
| ISBN | 082182872X |
| NCID | BA68712652 |
| 巻冊次 | : hardcover ; ISBN:082182872X |
| 登録日 | 2009.11.02 |
| 更新日 | 2009.11.02 |