The Library
New bounds for formula size
Tools
Tools
Tools
Paterson, Michael S. (1976) New bounds for formula size. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)
|
Text
WRAP_Paterson_cs-rr-016.pdf - Published Version Download (611Kb) | Preview |
Abstract
A variety of theorems bounding the formula size of rather simple Boolean functions are described here for the first time. The principal results are improved lower and upper bounds for symmetric functions.
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Functions, Computational complexity | ||||
| Series Name: | Theory of Computation Report | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Official Date: | December 1976 | ||||
| Dates: |
|
||||
| Number: | Number 16 | ||||
| Number of Pages: | 10 | ||||
| DOI: | CS-RR-016 | ||||
| Institution: | University of Warwick | ||||
| Theses Department: | Department of Computer Science | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Publisher Statement: | M.S. Paterson, “New Bounds on Formula Size”, <i>Proceedings of the 3rd GI Conference on Theoretical Computer Science</i>, Lecture Notes in Computer Science 48, Springer-Verlag, pp. 17-26 (1977) | ||||
| Access rights to Published version: | Open Access | ||||
| Version or Related Resource: | Paterson, M.S. (1977). New bounds on formula. Proceedings of the 3rd GI Conference on Theoretical Computer Science. Lecture Notes in Computer Science, 48, Berlin: Springer-Verlag, pp. 17-26. |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
