The Library
The depth of all Boolean functions
Tools
Tools
Tools
McColl, W. F. and Paterson, Michael S. (1975) The depth of all Boolean functions. Coventry, UK: Department of Computer Science..
Full text not available from this repository.
Official URL: http://eprints.dcs.warwick.ac.uk/1130/1/cs-rr-007....
Abstract
It is shown that every Boolean function of $n$ arguments has a circuit of depth $n+1$ over the basis ${f|f:{0,1}^2 \rightarrow {01}}$.
| Item Type: | Report |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science) |
| Divisions: | Faculty of Science > Computer Science |
| Publisher: | Department of Computer Science |
| Place of Publication: | Coventry, UK |
| Date: | August 1975 |
| Identification Number: | CS-RR-007 |
| Institution: | University of Warwick |
| Theses Department: | Department of Computer Science |
| Status: | Not Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Open Access |
| Related URLs: | |
| URI: | http://wrap.warwick.ac.uk/id/eprint/46304 |
Actions (login required)
 |
View Item |
