Boolean Function Complexity

doi:10.1017/CBO9780511526633

- Get access
  
  Buy a print copy
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 6
Cited by
- 6
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

2000. 10.1162/jmlr.2003.3.4-5.709. CrossRef Listing of Deleted DOIs, Vol. 1, Issue. ,

CrossRef

Google Scholar

Feldman, Jacob 2003. A catalog of Boolean concepts. Journal of Mathematical Psychology, Vol. 47, Issue. 1, p. 75.

CrossRef

Google Scholar

Zheng, Jeffrey Zhi J. and Zheng, Christian H. 2010. A framework to express variant and invariant functional spaces for binary logic. Frontiers of Electrical and Electronic Engineering in China, Vol. 5, Issue. 2, p. 163.

CrossRef

Google Scholar

Broutin, Nicolas and Mailler, Cécile 2018. And/or trees: A local limit point of view. Random Structures & Algorithms, Vol. 53, Issue. 1, p. 15.

CrossRef

Google Scholar

Zheng, Jeffrey 2019. Variant Construction from Theoretical Foundation to Applications. p. 3.

CrossRef

Google Scholar

Alon, Noga Gonen, Alon Hazan, Elad and Moran, Shay 2021. Boosting simple learners. p. 481.

CrossRef

Google Scholar

Edited by M. S. Paterson, University of Warwick

Publisher:: Cambridge University Press
Online publication date:: September 2009
Print publication year:: 1992
Online ISBN:: 9780511526633
DOI:: https://doi.org/10.1017/CBO9780511526633

Subjects:: Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Discrete Mathematics Information Theory and Coding
Series:: London Mathematical Society Lecture Note Series (169)

46.99 (USD)

Digital access for individuals
(PDF download and/or read online)
Add to cart

Added to cart

Digital access for individuals
(PDF download and/or read online)
View cart
Export citation
Buy a print copy

Information

Contents

Metrics

By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
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 .

To save content items to your Kindle, first ensure [email protected] 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.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Metrics

Altmetric attention score

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Boolean Function Complexity

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Contents
pp v-vi

Preface
pp vii-vii

List of Participants
pp viii-x

Relationships Between Monotone and Non-Monotone Network Complexity
pp 1-24

On Read-Once Boolean Functions
pp 25-34

Boolean Function Complexity: a Lattice-Theoretic Perspective
pp 35-56

Monotone Complexity
pp 57-75

On Submodular Complexity Measures
pp 76-83

Why is Boolean Complexity Theory so Difficult?
pp 84-94

The Multiplicative Complexity of Boolean Quadratic Forms, a Survey
pp 95-108

Some Problems Involving Razborov-Smolensky Polynomials
pp 109-128

Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size
pp 129-139

Boolean Complexity and Probabilistic Constructions
pp 140-164

Networks Computing Boolean Functions for Multiple Input Values
pp 165-173

Optimal Carry Save Networks
pp 174-201

Metrics

Altmetric attention score

Full text views

Book summary page views

Boolean Function Complexity

Book description

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views