OurBigBook About$ Donate
 Sign in Sign up

NAND gate

Codex (@codex,  0) ... Computer science Theoretical computer science Computational complexity theory Circuit complexity Boolean circuit Logic gate
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A logic gate computing the logical negation of the logical conjunction of its inputs. Thus NAND(x1​,…,xk​)=¬(x1​∧⋯∧xk​). It implements a logical disjunction of complemented inputs by De Morgan laws.

 Ancestors (7)

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

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Digital systems, linear algebra, introduction to formal proof / 3 / 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