
Fortæl dine venner om denne vare:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics
Stasys Jukna
Pris
R 2.557,50
Bestilles fra fjernlager
Forventes klar til forsendelse 23. - 29. jul.
Tilføj til din iMusic ønskeseddel
Eller
Findes også som:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics
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.
621 pages, biography
Medie | Bøger Hardcover bog (Bog med hård ryg og stift omslag) |
Udgivet | 6. januar 2012 |
ISBN13 | 9783642245077 |
Forlag | Springer-Verlag Berlin and Heidelberg Gm |
Antal sider | 620 |
Mål | 165 × 242 × 39 mm · 1,08 kg |
Sprog | Tysk |