Computational Limitations for Small Depth Circuits

by Johan Hastad and Johan Torkel Håstad

Proving lower bounds on the amount of resources needed to compute specific functions is one of the most active branches of theoretical computer science. Significant progress has been made recently in proving lower bounds in two restricted models of Boolean circuits. One is the model of small depth circuits, and in this book Johan Torkel Hastad has developed very powerful techniques for proving exponential lower bounds on the size of small depth circuits'...

• Format: Hardcover
• Language: English
• ISBN: 0262081679
• ISBN13: 9780262081672
• Release Date: February 1987
• Publisher: MIT Press (MA)
• Length: 82 Pages
• Weight: 0.85 lbs.