McColl, William Finlay and Paterson, Michael S. (1975) The depth of all Boolean functions. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_McColl_cs-rr-007.pdf - Published Version Download (727Kb) | Preview

Request Changes to record.

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 -> {0,1}}.

Item Type:	Report
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Functions
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	August 1975
Dates:	Date Event August 1975 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 7
Number of Pages:	13
DOI:	CS-RR-007
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Reuse Statement (publisher, data, author rights):	M.S. Paterson and W.F. McColl, The Depth of all Boolean Functions, SIAM Journal on Computing 6(2), pp. 373-380 (1977)
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016
Version or Related Resource:	Paterson, M.S. and McColl, W.F. (1977). The depth of all Boolean functions. SIAM Journal on Computing, 6(2), pp. 373-380.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads