Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics - Stasys Jukna - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783642245077 - 6. januarja 2012
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics

Cena
€ 103,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 9. - 17. jun
Dodaj na svoj seznam želja iMusic

Na voljo tudi kot:

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.


621 pages, biography

Medij Knjige     Hardcover Book   (Knjiga s trdim hrbtom in platnicami)
Izdano 6. januarja 2012
ISBN13 9783642245077
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 620
Dimenzije 165 × 242 × 39 mm   ·   1,08 kg
Jezik Nemščina  

Več od Stasys Jukna

Prikaži vse

Mere med samme udgiver