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...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edisyon: | 1st ed. 2012. |
| Seri Bilgileri: | Algorithms and Combinatorics
27 |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
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 |
| LEADER | 03397nam a22003737a 4500 | ||
|---|---|---|---|
| 001 | 974151 | ||
| 008 | 120309q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN15908511X | ||
| 020 | |a 9783642245084 | ||
| 041 | 0 | |a eng | |
| 082 | |a 519 | ||
| 100 | 1 | |a Jukna, Stasys, |d 1953- | |
| 245 | 1 | 0 | |a Boolean Function Complexity : |b Advances and Frontiers |c by Stasys Jukna. |
| 250 | |a 1st ed. 2012. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Algorithms and Combinatorics |v 27 |x 2197-6783 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a Part I Basics Part II Communication Complexity Part III Circuit Complexity Part IV Bounded Depth Circuits Part V Branching Programs Part VI Fragments of Proof Complexity A Epilog B Mathematical Background References Index | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics | ||
| 776 | 0 | |0 160327806 |t Boolean function complexity |o advances and frontiers |f Stasys Jukna |c Berlin |n Springer |d 2012 |p 1 vol. (XV-617 p.) |s Algorithms and combinatorics |z 978-3-642-24507-7 | |
| 776 | 0 | |0 160327806 |t Boolean function complexity |o advances and frontiers |f Stasys Jukna |c Berlin |n Springer |d 2012 |p 1 vol. (XV-617 p.) |s Algorithms and combinatorics |z 978-3-642-24507-7 | |
| 776 | 0 | |t Boolean Function Complexity |b Texte imprimé |z 9783642431449 | |
| 776 | 0 | |0 160327806 |t Boolean function complexity |o advances and frontiers |f Stasys Jukna |c Berlin |n Springer |d 2012 |p 1 vol. (XV-617 p.) |s Algorithms and combinatorics |z 978-3-642-24507-7 | |
| 776 | 0 | |t Boolean Function Complexity |b Texte imprimé |z 9783642245091 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-24508-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-CKJQB0QR-Z |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750603623 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-24508-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75396385X |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-24508-4 |z Accès INSA CVL | |
| 997 | |0 974151 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||