The Complexity of Boolean Functions
Presents a large number of research results on the complexity of Boolean functions in non-uniform computation models. It has a direct relevance to practical problems in the computer aided design of digital circuits.
Tag(s): Theory of Computation
Publication date: 01 Jan 1991
ISBN-10: 0471915556
ISBN-13: n/a
Paperback: 470 pages
Views: 19,136
The Complexity of Boolean Functions
About The Author(s)
No information is available for this author.