The size and depth of Boolean circuits
We study the relationship between size and depth for Boolean circuits. Over four decades, very few results were obtained for either special or general Boolean circuits. Spira showed in 1971 that any Boolean formula of size s can be simulated in depth O(log s). Spira's result means that an ar...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/21370 |