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
Boolean Function Complexity by M. S. Paterson | N. J. Hitchin | Michael S. Paterson is listed under Cambridge University Press on BookBajar. Full details, specifications and reader reviews are below.
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
Reader's Guide
What This Book Covers
- ·The main subject matter of Boolean Function Complexity
- ·Ideas and detail relevant to Cambridge University Press
- ·Context that helps make sense of the material as a whole
Best Suited For
Readers with an interest in Cambridge University Press, from students to hobbyists.
Why It Stands Out
- ·Ships as a genuine physical copy, checked before dispatch
- ·Covered by BookBajar's 15-day return window
Frequently Asked Questions
What is the price of Boolean Function Complexity?
Boolean Function Complexity starts from ₹4637 at BookBajar. Available in Paperback.
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.
What is BookBajar's return policy on Boolean Function Complexity?
Boolean Function Complexity can be returned within 15 days of delivery for a full refund. Reach out to info@bookbajar.in or call +91 9087 410 993 to start a return.
What is the ISBN of Boolean Function Complexity?
Boolean Function Complexity has ISBN 9780521408264 (ISBN-10: 0521408261). Use this to confirm you're ordering the exact edition listed here.
What can I expect from Boolean Function Complexity?
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.
Product ID: isbn-9780521408264
🛒 Customers Also Bought
Nanoscale Energy Transport and Conversion (English, Gang Chen)
₹4,697
Die Archetypentheorie Von C.G. Jung (English, Heinrich H. Balmer)
₹3,508
Arzneiverordnungs-Report 2019 (English, Ulrich Schwabe | Dieter Paffrath | Wolf-Dieter Ludwig)
₹4,965
Modular Forms on Half-Spaces of Quaternions (English, Aloys Krieg)
₹5,543
Riesen Des Meeres (English, E. J. Slijper)
₹3,143
Valproinsäure (English, Günter Krämer | J. Walden)
₹3,873Related Products
Die Proximalen Humerusfrakturen (English, Fabrizio Moro | Rainer-Peter Meyer | Andreas Lütscher)
₹4,965
Differentialgleichungen Mit MathCAD Und MATLAB (English, Hans Benker)
₹3,508
Mathematik 1 (English, Albert Fetzer | Heiner Fränkel | Dietrich Feldmann)
₹3,508
Parallel Execution of Parlog (English, Andrew Cheese)
₹5,471
Einführung in (Natur-)Wissenschaftliches Denken (English, Hans Mohr)
₹3,143