2-satisfiability
theoretical computer science problem
Facts
3 properties- Instance of
- computational problem
- Subclass of
- boolean satisfiability problem[2]
- Computational complexity
- NL-complete[3]
🏷️ Also known as
en 2-satisfiability
ar قابلية الإرضاء الثنائية
es 2-satisfactibilidad
fr problème 2-SAT
hu 2-SAT
hu 2-kielégíthetőség
hu 2-SAT probléma
it 2-SAT
it 2SAT
zh 2-可滿足性
🔖 Identifiers · 3
- Freebase ID
- /m/02hkyt
- Microsoft Academic ID (discontinued)
- 15481378
- Stack Exchange tag
- cs.stackexchange.com, cstheory.stackexchange.com, stackoverflow.com
Press Enter · cited answer in seconds
0 sources
Summary
2-satisfiability is a computational problem[1].