株式会社極東書店トップ ＞ 商品一覧 ＞ Boolean Function Complexity.
商品詳細
Boolean Function Complexity.
・ISBN 978-0-521-40826-4 paper GB£ 50.00
￥15,840.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-0-511-52663-3
| 著者・編者 | Paterson, M. S. (ed.), |
|---|---|
| シリーズ | London Mathematical Society Lecture Note Series |
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 1992 |
| ページ数 | 212 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-8741＞ |
解説
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.