
Fortell venner om denne varen:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics
Stasys Jukna
Pris
Mex$ 2.158
Bestillingsvarer
Forventes levert 25. jul - 4. aug
Legg til iMusic ønskeliste
Eller
Finnes 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
Media | Bøker Innbunden bok (Bok med hard rygg og stivt omslag) |
Utgitt | 6. januar 2012 |
ISBN13 | 9783642245077 |
Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
Antall sider | 620 |
Mål | 165 × 242 × 39 mm · 1,08 kg |
Språk | Tysk |