Boolean Function Complexity

Name: Boolean Function Complexity
Brand: Cambridge University Press
SKU: 9780521408264
Price: 4637.00 INR
Availability: InStock

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

Cambridge University Press

₹4,637

Free delivery. Nothing extra to pay at checkout.

New copy. Each book is ordered new from our distributor, Atlantic Books, after you place your order.
Delivery in 3–7 days to any serviceable pincode in India, with tracking.
Cash on delivery. Pay when the parcel reaches you.
15-day returns. See what qualifies.

From the publisher

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.

Description supplied by the publisher.