Cargando…
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"...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Edición: | 1st ed. 2012. |
| Colección: | Algorithms and Combinatorics,
27 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-24508-4 | ||
| 003 | DE-He213 | ||
| 005 | 20220112183123.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120104s2012 gw | s |||| 0|eng d | ||
| 020 | |a 9783642245084 |9 978-3-642-24508-4 | ||
| 024 | 7 | |a 10.1007/978-3-642-24508-4 |2 doi | |
| 050 | 4 | |a QA76.9.M35 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a MAT003000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Jukna, Stasys. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Boolean Function Complexity |h [electronic resource] : |b Advances and Frontiers / |c by Stasys Jukna. |
| 250 | |a 1st ed. 2012. | ||
| 264 | 1 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2012. | |
| 300 | |a XVI, 620 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Algorithms and Combinatorics, |x 2197-6783 ; |v 27 | |
| 505 | 0 | |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. | |
| 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. | ||
| 650 | 0 | |a Computer science-Mathematics. | |
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 1 | 4 | |a Mathematical Applications in Computer Science. |
| 650 | 2 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Discrete Mathematics. |
| 650 | 2 | 4 | |a Mathematics of Computing. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642431449 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642245077 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642245091 |
| 830 | 0 | |a Algorithms and Combinatorics, |x 2197-6783 ; |v 27 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-642-24508-4 |z Texto Completo |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||