Title: Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169) (Volume 0)
Publisher: Cambridge University Press
Publication Date: 1992
Language: English
ISBN 10: 0521408261
ISBN 13: 9780521408264
Binding: Soft cover
Condition: New

About this title

Synopsis

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.

Book Description

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.

"About this title" may belong to another edition of this title.

Store Description

We have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!

Visit Seller's Storefront

Seller's business information

Miramar International Services LLC

Sale & Shipping Terms

Terms of Sale

www.californiabooks.com

Shipping Terms

www.californiabooks.com

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	3 to 7 business days	2 to 5 business days
First item	US$ 0.00	US$ 12.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.