
Fortæl dine venner om denne vare:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics 2012 edition
Stasys Jukna
Pris
Fr. 84,99
Bestilles fra fjernlager
Forventes klar til forsendelse 24. - 30. jul.
Tilføj til din iMusic ønskeseddel
Eller
Findes også som:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics 2012 edition
Stasys Jukna
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.
620 pages, biography
Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
Udgivet | 22. februar 2014 |
ISBN13 | 9783642431449 |
Forlag | Springer-Verlag Berlin and Heidelberg Gm |
Antal sider | 620 |
Mål | 155 × 235 × 36 mm · 961 g |
Sprog | Engelsk |