Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Boolean Function Complexity
- Advances and Frontiers
part of the Algorithms and Combinatorics series
- Language:
- English
- ISBN:
- 9783642245077
- Binding:
- Hardback
- Pages:
- 620
- Published:
- January 5, 2012
- Dimensions:
- 165x242x39 mm.
- Weight:
- 1076 g.
Delivery:
2-4 weeks
Expected delivery: July 27, 2025
Description of 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.
User ratings of Boolean Function Complexity
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Boolean Function Complexity can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2025 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
