Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780521408264

Contact seller

Report this item

Bibliographic Details

Title: Boolean Function Complexity (Paperback)
Publisher: Cambridge University Press, Cambridge
Publication Date: 1992
Language: English
ISBN 10: 0521408261
ISBN 13: 9780521408264
Binding: Paperback
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

Visit Seller's Storefront

Seller's business information

APOLLO ONLINE CORP.
605 Geddes Street, Wilmington, DE, 19805, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�ve changed
your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us
and we�ll respond within 2 business days.
Books ship from California and Michigan.

Shipping Terms

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	6 to 16 business days	6 to 14 business days
First item	US$ 0.00	US$ 0.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.