Gå direkt till innehållet
Boolean Function Complexity
Spara

Boolean Function Complexity

Lägsta pris på PriceRunner

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
Upplaga
2012 ed.
ISBN
9783642431449
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2014-02-22
Sidor
620