Boolean Function Complexity | Advances and Frontiers

Stasys Jukna

ISBN 10: 3642245072 / ISBN 13: 9783642245077

Published by Springer, 2012

About this Item

Boolean Function Complexity | Advances and Frontiers | Stasys Jukna | Buch | xvi | Englisch | 2012 | Springer | EAN 9783642245077 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Seller Inventory # 106784428

Bibliographic Details

• Title: Boolean Function Complexity | Advances and Frontiers
• Publisher: Springer
• Publication Date: 2012
• Language: English
• ISBN 10: 3642245072
• ISBN 13: 9783642245077
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 40D millimeters 241 millimeters width by 160 millimeters height by 40 millimeters depth
• Weight: 1109 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.

About the Author

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