Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-p566r Total loading time: 0 Render date: 2024-03-28T17:14:57.285Z Has data issue: false hasContentIssue false

Boolean Function Complexity: a Lattice-Theoretic Perspective

Published online by Cambridge University Press:  23 September 2009

M. S. Paterson
Affiliation:
University of Warwick
Get access

Summary

Abstract

Topical but classical results concerning the incidence relationship between prime clauses and implicants of a monotone Boolean function are derived by applying a general theory of computational equivalence and replaceability to distributive lattices. A non-standard combinatorial model for the free distributive lattice FDL(n) is described, and a correspondence between monotone Boolean functions and partitions of a standard Cayley diagram for the symmetric group is derived.

Preliminary research on-classifying and characterising the simple paths and circuits that are the blocks of this partition is summarised. It is shown in particular that each path and circuit corresponds to a characteristic configuration of implicants and clauses. The motivation for the research and expected future directions are briefly outlined.

Introduction

Models of Boolean formulae expressed in terms of the incidence relationship between the prime implicants and clauses of a function were first discovered several years ago, but they have recently been independently rediscovered by several authors, and have attracted renewed interest. They have been used in proving lower bounds by Karchmer and Wigderson and subsequently by Razborov. More general investigations aimed at relating the complexity of functions to the model have also been carried out by Newman [20].

This paper demonstrates the close connection between these classical models for monotone Boolean formulae and circuits and a general theory of computational equivalence as it applies to FDL(n): the (finite) distributive lattice freely generated by n elements. It also describes how the incidence relationships between prime implicants and clauses associated with monotone Boolean functions can be viewed as built up from a characteristic class of incidence patterns between relatively small subsets of implicants and clauses.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×