Book contents
- Frontmatter
- Contents
- Preface
- List of Participants
- 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 Theory so Difficult?
- The Multiplicative Complexity of Boolean Quadratic Forms, a Survey
- Some Problems Involving Razborov-Smolensky Polynomials
- Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size
- Boolean Complexity and Probabilistic Constructions
- Networks Computing Boolean Functions for Multiple Input Values
- Optimal Carry Save Networks
Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size
Published online by Cambridge University Press: 23 September 2009
Edited by
Book contents
- Frontmatter
- Contents
- Preface
- List of Participants
- 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 Theory so Difficult?
- The Multiplicative Complexity of Boolean Quadratic Forms, a Survey
- Some Problems Involving Razborov-Smolensky Polynomials
- Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size
- Boolean Complexity and Probabilistic Constructions
- Networks Computing Boolean Functions for Multiple Input Values
- Optimal Carry Save Networks
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Boolean Function Complexity , pp. 129 - 139Publisher: Cambridge University PressPrint publication year: 1992
- 3
- Cited by