Identifiant pérenne de la notice : 209183837
Notice de type
Notice de regroupement
Note publique d'information : 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
paprika.idref.fr
data.idref.fr
Documentation
