3-satisfiability problem
special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals
Facts
3 properties- Instance of
- computational problem, NP-complete[2]
- Computational complexity
- NP-complete[4]
🏷️ Also known as
en 3-satisfiability problem
en 3CNFSAT
en 3-SAT
en 3SAT
en 3-satisfiability
ar ٣سات
ar 3SAT
ar ٣SAT
ar 3-سات
ar ٣-سات
ar 3سات
de 3KNF-SAT
fr 3-SAT
fr 3 sat vers clique
fr 3-SAT vers clique
fr Problème 3-SAT
fr Problème 3SAT
it 3-SAT
ru 3SAT
🔖 Identifiers · 4
- Image (Wikimedia Commons)
- Sat reduced to Clique from Sipser.svg ↗
- Brilliant Wiki ID
- 3sat
- Google Knowledge Graph ID
- /g/1229kf2b
- Stack Exchange tag
- cs.stackexchange.com, quantumcomputing.stackexchange.com
🔗 Connections
Instance of 2
Belongs to 1
Computational complexity 1
Part of 1
Press Enter · cited answer in seconds
0 sources
Summary
3-satisfiability problem is a computational problem[1].