Boolean Function Complexity
Stasys Jukna
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2012
133,25 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9783642245077
- ISBN-10
- 3642245072
- Publisher
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Year
- 2012
- Publication date
- 2012-01-06
- Pages
- 620
- Dimensions
- 242x165x39
- Weight
- 1076