Tallenna
Boolean Function Complexity
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.
- Alaotsikko
- Advances and Frontiers
- Kirjailija
- Stasys Jukna
- Painos
- 2012 ed.
- ISBN
- 9783642431449
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 22.2.2014
- Sivumäärä
- 620
