Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics) - Tapa blanda

Libro 3 de 8: Algorithms and Combinatorics

Jukna, Stasys

 
9783642431449: Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics)
Tapa blanda
ISBN 10: 3642431445 ISBN 13: 9783642431449
Editorial: Springer, 2014

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2014
Idioma
Inglés
ISBN 10 
3642431445
ISBN 13 
9783642431449
Encuadernación
Tapa blanda
Número de páginas
636
Contacto del fabricante
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Alemania

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  3642245072 ISBN 13:  9783642245077
Editorial: Springer, 2012
Tapa dura