We a good story
Quick delivery in the UK

Boolean Function Complexity

About Boolean Function Complexity

Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods.

Show more
  • Language:
  • English
  • ISBN:
  • 9780521408264
  • Binding:
  • Paperback
  • Pages:
  • 212
  • Published:
  • November 4, 1992
  • Dimensions:
  • 151x227x11 mm.
  • Weight:
  • 315 g.
Delivery: 1-2 weeks
Expected delivery: December 5, 2024

Description of Boolean Function Complexity

Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods.

User ratings of Boolean Function Complexity



Find similar books
The book Boolean Function Complexity can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.