Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)

Jukna, Stasys

ISBN 10: 3642245072 / ISBN 13: 9783642245077

Editore: Springer, 2012

Riguardo questo articolo

Item in acceptable condition including possible liquid damage. As well answers may be filled in. May be missing DVDs, CDs, Access code, etc. 100%Money-Back Guarantee! Ship within 24 hours!!

Codice articolo 570W2K001ZWW_ns

Dati bibliografici

• Titolo: Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
• Editore: Springer
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 3642245072
• ISBN 13: 9783642245077
• Rilegatura: Rilegato
• Condizione: Acceptable

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

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