Abstract
Suppose we are given two binary strings, each consisting of n bits, a = a n−1 a n−2 ... a 0, and b = b n−1 b n−2 ... b 0. We want to solve the following problem: Interpret a and b as binary representations of two natural numbers and compute their sum (again in binary). We refer to this problem as ADD.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Remarks
C. Shannon. The synthesis of two-terminal switching circuits. Bell Systems Technical Journal, 28: 59–98, 1949.
O. B. Lupanov. A method of circuit synthesis. Izvestia VUZ Radiofizika, 1: 120–140, 1958.
J. E. Savage. The Complexity of Computing. John Wiley & Sons, New York, 1976.
M. J. Fischer. Lectures on network complexity. Universität Frankfurt/Main, 1974.
H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, MA, 1994.
A. K. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13: 423–439, 1984.
I. Wegener. The Complexity of Boolean Functions. WileyTeubner series in computer science. B. G. Teubner & John Wiley, Stuttgart, 1987.
I. Wegener. Effiziente Algorithmen fur grundlegende Funktionen. Leitfäden und Monographien der Informatik. B. G. Teubner, Stuttgart, 1989.
C. Wilson. Relativized NC. Mathematical Systems Theory, 20: 13–29, 1987.
U. Schöning. Complexity and Structure. Lecture Notes in Com- puter Science 211, Springer-Verlag, Berlin, 1986.
A. K. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13: 423–439, 1984.
P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM Journal on Computing, 15: 994–1003, 1986.
I. Wegener. The Complexity of Boolean Functions. WileyTeubner series in computer science. B. G. Teubner and John Wiley, Stuttgart, 1987.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vollmer, H. (1999). Complexity Measures and Reductions. In: Introduction to Circuit Complexity. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03927-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-03927-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08398-3
Online ISBN: 978-3-662-03927-4
eBook Packages: Springer Book Archive