Boolean Function Complexity

Advances and Frontiers

Stasys Jukna

ca. 85,28
Amazon iTunes Hugendubel Bü kobo Osiander Google Books Barnes&Noble Legimi Kulturkaufhaus
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer Berlin Heidelberg img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Mathematik


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 "e;complexity Waterloo"e; 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.

Weitere Titel von diesem Autor
Weitere Titel in dieser Kategorie
Cover Stieltjes Integral
David Cruz-Uribe
Cover Stieltjes Integral
Gregory Convertito
Cover Price of Cake
Clement Deslandes
Cover Computational Optimization
Vladislav Bukshtynov
Cover Computational Optimization
Vladislav Bukshtynov
Cover Infinite Groups
Leonid A. Kurdachenko
Cover Infinite Groups
Martyn R. Dixon