Siirry suoraan sisältöön
Boolean Function Complexity
Tallenna

Boolean Function Complexity

Kirjailija:
sidottu, 2012
englanti

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.

Alaotsikko
Advances and Frontiers
Kirjailija
Stasys Jukna
ISBN
9783642245077
Kieli
englanti
Paino
446 grammaa
Julkaisupäivä
6.1.2012
Sivumäärä
620