Boolean Function Complexity : Advances and Frontiers
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this complexity Waterloo that have...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Phiên bản: | 1st ed. 2012. |
| Loạt: | Algorithms and Combinatorics
27 |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Boolean function complexity, advances and frontiers, Stasys Jukna, Berlin, Springer, 2012, 1 vol. (XV-617 p.), Algorithms and combinatorics, 978-3-642-24507-7 • Boolean function complexity, advances and frontiers, Stasys Jukna, Berlin, Springer, 2012, 1 vol. (XV-617 p.), Algorithms and combinatorics, 978-3-642-24507-7 • Boolean Function Complexity, Texte imprimé, 9783642431449 • Boolean function complexity, advances and frontiers, Stasys Jukna, Berlin, Springer, 2012, 1 vol. (XV-617 p.), Algorithms and combinatorics, 978-3-642-24507-7 • Boolean Function Complexity, Texte imprimé, 9783642245091 |