Boolean Function Complexity - London Mathematical Society Lecture Note Series - M S Paterson - Books - Cambridge University Press - 9780521408264 - November 5, 1992
In case cover and title do not match, the title is correct

Boolean Function Complexity - London Mathematical Society Lecture Note Series

M S Paterson

Price
SEK 549
excl. VAT

Ordered from remote warehouse

Expected delivery May 2 - 15

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Boolean Function Complexity - London Mathematical Society Lecture Note Series

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.

212 pages, some line drawings, some tables

Media Books     Paperback Book   (Book with soft cover and glued back)
Released November 5, 1992
ISBN13 9780521408264
Publishers Cambridge University Press
Pages 212
Dimensions 151 × 227 × 11 mm   ·   315 g
Editor Paterson, M. S. (University of Warwick)

See all of M S Paterson ( e.g. Paperback Book )