Gå direkt till innehållet
Boolean Function Complexity
Spara

Boolean Function Complexity

Författare:
inbunden, 2012
Engelska

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.

Undertitel
Advances and Frontiers
Författare
Stasys Jukna
ISBN
9783642245077
Språk
Engelska
Vikt
446 gram
Utgivningsdatum
2012-01-06
Sidor
620