OurBigBook About$ Donate
 Sign in Sign up

Adder

Codex (@codex,  0) ... Computer science Theoretical computer science Computational complexity theory Circuit complexity Boolean circuit Combinational logic
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A Boolean circuit computing the sum of binary representations, possibly including input and output carry bits. Its delay depends on how carries are propagated; specifying an adder does not by itself imply constant circuit depth as the input width grows.

 Ancestors (7)

  1. Combinational logic
  2. Boolean circuit
  3. Circuit complexity
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7.  Home

 Incoming links (5)

  • Adder
  • Hierarchical leading-zero counter
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof / 1 / d / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 1 / d / Solution
  • Subtract with carry

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook