Boolean function complexity: advances and frontiers
Auteur :
Jukna, Stasys
Éditeur :
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN :
9783642431449
Date de publication :
22 févr. 2014
Dimensions :
23,5 x 15,5 cm
Langue :
Anglais
Pays d'origine :
Allemagne
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. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science.