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 hav...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Jukna, Stasys (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
Σειρά:Algorithms and Combinatorics, 27
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02691nam a22005175i 4500
001 978-3-642-24508-4
003 DE-He213
005 20170124141428.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 
040 |d GrThAP 
050 4 |a Q350-390 
050 4 |a QA10.4 
072 7 |a PBW  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
082 0 4 |a 519  |2 23 
100 1 |a Jukna, Stasys.  |e author. 
245 1 0 |a Boolean Function Complexity  |h [electronic resource] :  |b Advances and Frontiers /  |c by Stasys Jukna. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |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 0937-5511 ;  |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 Mathematics. 
650 0 |a Computers. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Information theory. 
650 0 |a Combinatorics. 
650 1 4 |a Mathematics. 
650 2 4 |a Information and Communication, Circuits. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Combinatorics. 
650 2 4 |a Mathematics of Computing. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642245077 
830 0 |a Algorithms and Combinatorics,  |x 0937-5511 ;  |v 27 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-24508-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649)