Boolean Function Complexity

by M. S. Paterson (Editor)

Overview

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.

Product Details

ISBN-13:	9780521408264
Publisher:	Cambridge University Press
Publication date:	11/05/1992
Series:	London Mathematical Society Lecture Note Series , #169
Pages:	212
Product dimensions:	5.94(w) x 8.94(h) x 0.43(d)

Table of Contents

1. Relationships between monotone and non-monotone network complexity; 2. On read-once Boolean functions; 3. Boolean function complexity: a lattice-theoretic perspective; 4. Monotone complexity; 5. On submodular complexity measures; 6. Why is Boolean complexity so difficult?; 7. The multiplicative complexity of Boolean quadratic forms; 8. Some problems involving Razborov–Smolensky polynomials; 9. Symmetry functions in AC0; 10. Boolean complexity and probabilistic constructions; 11. Networks computing Boolean functions for multiple input values; 12. Optimal carry save networks.