Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Boolean Function Complexity

by M. S. Paterson , N. J. Hitchin , Michael S. Paterson
Save 1% Save 1%
Current price ₹5,150.00
Original price ₹5,194.00
Original price ₹5,194.00
Original price ₹5,194.00
(-1%)
₹5,150.00
Current price ₹5,150.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9780521408264
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Publication Date:
  • Pages: 212
  • Original Price: USD 53.0
  • Language: English
  • Edition: N/A
  • Item Weight: 318 grams
  • BISAC Subject(s): General

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 scientists working in related areas.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us