Stasys Jukna
eBook, PDF

Boolean Function Complexity (eBook, PDF)

Advances and Frontiers

Versandkostenfrei!
Sofort per Download lieferbar
65,95 €
inkl. MwSt.
Alle Infos zum eBook verschenken
Weitere Ausgaben:
PAYBACK Punkte
33 °P sammeln!
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 co...

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.