✓ 100% Original Books — Direct from Publishers🚚 Free Delivery Across India💳 Cash on Delivery Available↩️ 15-Day Easy Returns🔒 Secure Razorpay Payments📚 Lakhs of Titles in Stock⚡ Fast Dispatch Same Day🏅 Trusted by Indian Readers
✓ 100% Original Books — Direct from Publishers🚚 Free Delivery Across India💳 Cash on Delivery Available↩️ 15-Day Easy Returns🔒 Secure Razorpay Payments📚 Lakhs of Titles in Stock⚡ Fast Dispatch Same Day🏅 Trusted by Indian Readers
Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) - Image 1 - BookBajar

Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson)

by M. S. Paterson | N. J. Hitchin | Michael S. Paterson

Delivery options

₹4,637
100% Genuine Book · Verified Seller
Free Shipping · Ships Today💵 COD Available📦 Delivery in 3-4 days

Available Offers

Free Delivery — Ships same day. Delivery in 3-4 business days.

15-Day Easy Returns — hassle-free return & full refund.

Secure Payment — 100% safe checkout with UPI, Cards & Net Banking.

Total: ₹4,637

Book Details

Publisher
Cambridge University Press
Language
English
ISBN-13
9780521408264
ISBN-10
0521408261
Author
M. S. Paterson | N. J. Hitchin | Michael S. Paterson

About the Book

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. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer sc…

ISBN: 9780521408264

ISBN-13: 9780521408264
ISBN-10: 0521408261

Frequently Asked Questions

What is the price of Boolean Function Complexity?
Boolean Function Complexity starts from ₹4637 at BookBajar. Available in Paperback. This is one of the best prices available online in India.
Who is the author of Boolean Function Complexity?
M. S. Paterson | N. J. Hitchin | Michael S. Paterson is the author of Boolean Function Complexity. Browse more books by M. S. Paterson | N. J. Hitchin | Michael S. Paterson on BookBajar.
Is Boolean Function Complexity available in Paperback and Hardcover?
Yes, Boolean Function Complexity is available in Paperback on BookBajar. Select your preferred format on the product page.
Does BookBajar offer free delivery for Boolean Function Complexity?
Yes, BookBajar offers free delivery for Boolean Function Complexity across India. No minimum order value required.
Is Cash on Delivery available for Boolean Function Complexity?
Yes, Cash on Delivery (COD) is available for Boolean Function Complexity on BookBajar. You can pay when your order is delivered.
ISBN-10: 0521408261. ISBN-13: 9780521408264. Buy Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) online. Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) price in India. M. S. Paterson | N. J. Hitchin | Michael S. Paterson books. Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) best price. Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) free delivery India. Boolean Function Complexity (English, M. S. Paterson | N. J. Hitchin | Michael S. Paterson) BookBajar.
Product ID: isbn-9780521408264