# 3-satisfiability problem

> special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals

**Wikidata**: [Q339688](https://www.wikidata.org/wiki/Q339688)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/3-SAT)  
**Source**: https://4ort.xyz/entity/3-satisfiability-problem


## References

1. Reducibility among combinatorial problems. 1972