Gå direkte til innholdet
Boolean Function Complexity
Spar

Boolean Function Complexity

Forfatter:
innbundet, 2012
Engelsk

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.

Undertittel
Advances and Frontiers
Forfatter
Stasys Jukna
ISBN
9783642245077
Språk
Engelsk
Vekt
446 gram
Utgivelsesdato
6.1.2012
Antall sider
620