Abstract
In this chapter we introduce and study Boolean circuits. Since real computers are built from electronic devices, digital circuits, this is reason enough to consider their complexity. The circuits that we consider here are idealizations of digital circuits just as the Turing machine is an idealization of real digital computers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Homer, S., Selman, A.L. (2011). Nonuniform Complexity. In: Computability and Complexity Theory. Texts in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0682-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0682-2_8
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0681-5
Online ISBN: 978-1-4614-0682-2
eBook Packages: Computer ScienceComputer Science (R0)