Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics - Stasys Jukna - Bøker - Springer-Verlag Berlin and Heidelberg Gm - 9783642431449 - 22. februar 2014
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics 2012 edition

Stasys Jukna

Pris
S$ 109

Bestillingsvarer

Forventes levert 25. jul - 4. aug
Legg til iMusic ønskeliste
Eller

Finnes også som:

Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics 2012 edition

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

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 22. februar 2014
ISBN13 9783642431449
Utgivere Springer-Verlag Berlin and Heidelberg Gm
Antall sider 620
Mål 155 × 235 × 36 mm   ·   961 g
Språk Engelsk  

Vis alle

Mer med Stasys Jukna