Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, 27, Band 27) - Hardcover

Buch 3 von 8: Algorithms and Combinatorics

Jukna, Stasys

 
9783642245077: Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, 27, Band 27)
Hardcover
ISBN 10: 3642245072 ISBN 13: 9783642245077
Verlag: Springer, 2012

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

http://www.thi.informatik.uni-frankfurt.de/~jukna/

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2012
Sprache
Englisch
ISBN 10 
3642245072
ISBN 13 
9783642245077
Einband
Gebundene Ausgabe
Anzahl der Seiten
636
Kontakt zum Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783642431449: Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics)

Vorgestellte Ausgabe

ISBN 10:  3642431445 ISBN 13:  9783642431449
Verlag: Springer, 2014
Softcover