Non-Fiction Books:

Boolean Function Complexity

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$115.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $28.75 with Afterpay Learn more

6 weekly interest-free payments of $19.17 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 12-24 June using International Courier

Description

Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods. Here 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.
Release date NZ
November 5th, 1992
Audience
  • Professional & Vocational
Contributor
  • Edited by M.S. Paterson
Illustrations
Worked examples or Exercises
Pages
212
Dimensions
151x227x11
ISBN-13
9780521408264
Product ID
2362472

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...