Boolean Function Complexity (London Mathematical Society Lecture Note Series) Book + PRICE WATCH * Amazon pricing is not included in price watch

Boolean Function Complexity (London Mathematical Society Lecture Note Series) Book

Papers from the 1990 Durham symposium on Boolean function complexity reveal exciting advances over recent years in a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods.Read More

from£35.69 | RRP: £24.99
* Excludes Voucher Code Discount Also available Used from £9.93
  • Product Description

    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.

  • 0521408261
  • 9780521408264
  • 5 November 1992
  • Cambridge University Press
  • Paperback (Book)
  • 212
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.