By Stasys Jukna
Boolean circuit complexity is the combinatorics of desktop technology and comprises many interesting difficulties which are effortless to nation and clarify, even for the layman. This publication is a accomplished description of easy reduce sure arguments, masking some of the gemstones of this “complexity Waterloo” which have been came upon during the last a number of many years, correct as much as effects from the final yr or . Many open difficulties, marked as examine difficulties, are pointed out alongside the way in which. the issues are typically of combinatorial taste yet their recommendations can have nice results in circuit complexity and laptop technology. The ebook should be of curiosity to graduate scholars and researchers within the fields of laptop technology and discrete mathematics.