Home
Hostname: page-component-7f7b94f6bd-8p2w5 Total loading time: 0.413 Render date: 2022-06-30T23:01:50.719Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true
Boolean Functions
Theory, Algorithms, and Applications
Buy print or eBook[Opens in a new window]

# B - Algorithmic complexity

Published online by Cambridge University Press:  01 June 2011

## Summary

By and large, we assume that the readers of this book have at least some intuitive knowledge about algorithms and complexity. For the sake of completeness, however, we provide in this appendix an informal introduction to fundamental concepts of computational complexity: problems, algorithms, running time, easy and hard problems, etc. For a more thorough and rigorous introduction to this topic, we refer the reader to the classical monograph by Garey and Johnson [371], or to other specialized books like Aho, Hopcroft and Ullman [11], Papadimitriou [725], or Papadimitriou and Steiglitz [726]. Note that Cook et al. [211] and Schrijver [814] also provide gentle introductions to the topic, much in the spirit of this appendix.

In Section B.8, we propose a short primer on the complexity of list-generating algorithms; such algorithms are usually not discussed in basic textbooks on complexity theory, but they arise naturally in several chapters of our book.

Decision problems

Intuitively speaking, an algorithmic or computational problem is a generic question whose formulation contains a number of undetermined parameters. For instance, we can think of “addition” as the generic problem of adding two numbers (the numbers themselves must be specified before any specific computation can be performeed). Similarly, “solving quadratic equations” of the form ax2+bx+c = 0 is a problem which can be handled by an appropriate algorithm as soon as the numerical values of the parameters a,b, and c are known.

Type
Chapter
Information
Boolean Functions
Theory, Algorithms, and Applications
, pp. 615 - 626
Publisher: Cambridge University Press
Print publication year: 2011

## 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.)

### Purchase

Buy print or eBook[Opens in a new window]

# Save book to 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
×