+612 9045 4394
 
CHECKOUT
Boolean Function Complexity : London Mathematical Society Lecture Note Series - M. S. Paterson

Boolean Function Complexity

London Mathematical Society Lecture Note Series

By: M. S. Paterson (Editor)

Paperback Published: 4th January 1993
ISBN: 9780521408264
Number Of Pages: 212

Share This Book:

Paperback

This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

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.

Relationships between monotone and non-monotone network complexity
On read-once Boolean functions
Boolean function complexity: a lattice-theoretic perspective
Monotone complexity
On submodular complexity measures
Why is Boolean complexity so difficult?
The multiplicative complexity of Boolean quadratic forms
Some problems involving Razborov-Smolensky polynomials
Symmetry functions in AC0
Boolean complexity and probabilistic constructions
Networks computing Boolean functions for multiple input values
Optimal carry save networks
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521408264
ISBN-10: 0521408261
Series: London Mathematical Society Lecture Note Series
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 212
Published: 4th January 1993
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 22.8 x 15.2  x 1.2
Weight (kg): 0.32

This product is categorised by