We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Complexity of Monotone Boolean Functions and an Algorithm for Finding Shortest Paths on a Graph

Thumbnail Image
Download
Name

MIT-LCS-TR-238.pdf

Size

5.69 MB

Format

Adobe PDF

Checksum (MD5)

3745be6cb0e53f6e702f9e79394dba01

Author(s)
Bloniarz, Peter Anthony
Advisor(s)
Meyer, Albert R.
Date Issued
June 1980
Series/Report no.
MIT-LCS-TR-238
Abstract
The first part of this thesis considers the complexity of Boolean functions. The main complexity measures used are the number of gates in combinational networks and the size of Boolean formulas. The case of monotone realizations, using only the operations AND and OR, of monotone functions is emphasized.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.