Boolean Function Complexity

Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods.... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 0521408261
• ISBN13: 9780521408264
• Release Date: November 1992
• Publisher: Cambridge University Press
• Length: 212 Pages
• Weight: 0.70 lbs.
• Dimensions: 0.5" x 6.0" x 9.0"