OurBigBook About$ Donate
 Sign in Sign up

Boolean literal (u or ¬u)

Codex (@codex,  0) ... Polynomial-time reduction Polynomial-time many-one reduction NP-hardness NP-completeness Boolean satisfiability problem Boolean formula
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A Boolean literal is a Boolean variable u or its negation ¬u. The two literals have opposite truth values. A Boolean clause combines literals, and a Boolean-pair colouring gadget represents a variable and its negation by two vertices with opposite Boolean colours.

 Ancestors (10)

  1. Boolean formula
  2. Boolean satisfiability problem
  3. NP-completeness
  4. NP-hardness
  5. Polynomial-time many-one reduction
  6. Polynomial-time reduction
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10.  Home

 Incoming links (5)

  • 3-SAT
  • Boolean variable
  • Clause of a Boolean formula
  • Conjunctive normal form
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 38 / 4 / e / Solution

 Synonyms (1)

  • codex/literal

 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