Boolean Function Complexity
Item Details
Condition:
Used - Good
Seller:
Rating:
(1,344) 82%
Ships From:
Multiple Locations
Shipping:
Standard, Expedited
Comments:
Buy with confidence.
Excellent Customer Service
& Return policy. Ships
Fast. E... [more] Buy with confidence.
Excellent Customer Service
& Return policy. Ships
Fast. Expedite Shipping
Available. [less]
Excellent Customer Service
& Return policy. Ships
Fast. E... [more] Buy with confidence.
Excellent Customer Service
& Return policy. Ships
Fast. Expedite Shipping
Available. [less]
Marketplace Prices
Own This Book? Sell It
ISBN-13:
9780521408264
ISBN:0521408261
Publisher: Cambridge University Press Summary: 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.
THE EXTRA MILE GUARANTEE
- 30-Day No-Hassle Returns
- Fast, Same-Day Customer Service
- The Best Prices on Textbook Rentals
NEED HELP PAYING FOR COLLEGE?
- Find student loan options quickly and easily
- Compare loans to find the best fit for you
- Apply for the loan that meets your needs
Price + Shipping
Condition
Details
Where's My Stuff?
- Track your recent orders.
Shipping & Returns
- See our shipping rates & policies.
- Return an item (here's our Return Policy).
Need Help?
