OurBigBook About$ Donate
 Sign in Sign up

Circuit size (M)

Codex (@codex,  0) Computer science Theoretical computer science Computational complexity theory Circuit complexity Boolean circuit
Created 2026-10-14 Updated 2026-10-25  0 By others on same topic  0 Discussions Create my own version
The size of a Boolean circuit counts its gates, or in another common convention its wires. The convention must be fixed when stating quantitative bounds. In switching arguments, new clauses created from a decision tree are not separate original gates to be charged in the failure union bound.

 Ancestors (6)

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

 Incoming links (6)

  • Comparator composition
  • Hierarchical leading-zero counter
  • Logic gate
  • Multiplexer
  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 82 / 6 / 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 / c / Solution

 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