Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169) - Softcover
Book 155 of 387: London Mathematical Society Lecture Notes
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.
"synopsis" may belong to another edition of this title.
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.
Search results for Boolean Function Complexity (London Mathematical Society...
Stock Image
Boolean Function Complexity
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
Used
Softcover
First Edition
Seller: Better World Books, Mishawaka, IN, U.S.A.
Seller rating 5 out of 5 stars
Condition: Fine. 1st Edition. Used book that is in almost brand-new condition. Seller Inventory # 52420908-6
Stock Image
Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169)
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190001918
Stock Image
Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169)
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521408264
Stock Image
Boolean Function Complexity (Paperback)
Published by
Cambridge University Press, Cambridge, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. 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
Stock Image
Boolean Function Complexity
Published by
Cambridge University Press CUP, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 212. Seller Inventory # 26523660
Stock Image
Boolean Function Complexity
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 211 pages. 8.75x6.00x0.50 inches. In Stock. This item is printed on demand. Seller Inventory # __0521408261
Buy New
US$ 72.24
US$ 13.39 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Boolean Function Complexity
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 212 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 7357011
Buy New
US$ 79.45
US$ 8.70 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series)
Published by
Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521408264
Buy New
US$ 70.26
US$ 20.74 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Boolean Function Complexity
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521408264
Buy New
US$ 72.46
US$ 19.08 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Boolean Function Complexity
Published by
Cambridge University Press, 1992
ISBN 10: 0521408261
ISBN 13: 9780521408264
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 212. Seller Inventory # 18523654
Buy New
US$ 86.67
US$ 11.64 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 4 available