LIBERO WebOPAC Catalogue Display (W561)

Catalogue Information
Field name	Details
Dewey Class	519
Title	Boolean Function Complexity ([Ebook]) : Advances and Frontiers / by Stasys Jukna.
Author	Jukna, Stasys
Other name(s)	SpringerLink (Online service)
Publication	Berlin, Heidelberg : Springer , 2012.
Physical Details	XV, 617 pages: 70 illus. : online resource.
Series	Algorithms and Combinatorics 0937-5511 ; ; 27
ISBN	9783642245084
Summary Note	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.:
Contents note	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.
System details note	Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site	http://dx.doi.org/10.1007/978-3-642-24508-4
Links to Related Works	Subject References: Combinatorics . Computer Science . Information and communication, circuits . Information theory . Mathematics . Mathematics of Computing . Theory of Computation . Authors: Jukna, Stasys . Corporate Authors: SpringerLink (Online service) . Series: Algorithms and Combinatorics . Classification: 519 . 519 (DDC 23) .

Catalogue Display

Boolean Function Complexity: Advances and Frontiers

Reviews