OurBigBook About$ Donate
 Sign in Sign up

Conjunctive normal form (⋀i​⋁j​ℓij​)

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 formula is in conjunctive normal form when it is a conjunction of Boolean clauses. It is true precisely when every clause is true; an empty conjunction is true. 3-SAT restricts each clause to at most three Boolean literals.

 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 (2)

  • 3-SAT
  • Clause of a Boolean formula

 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