The Complexity of Monotone Boolean Functions and an Algorithm for Finding Shortest Paths on a Graph
| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Bloniarz, Peter Anthony | en_US |
| dc.date.accessioned | 2023-03-29T15:04:10Z | |
| dc.date.available | 2023-03-29T15:04:10Z | |
| dc.date.issued | 1980-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149519 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-238 | |
| dc.title | The Complexity of Monotone Boolean Functions and an Algorithm for Finding Shortest Paths on a Graph | en_US |
