Complexity hierarchies for Boolean functions |
| |
Authors: | William F. McColl |
| |
Affiliation: | (1) Department of Computer Studies, The University, LS2 9JT Leeds, England |
| |
Abstract: | Summary Circuit size and depth are two important complexity measures for a Boolean function. Uniform hierarchies are shown to exist with respect to each of these measures. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|