boolean satisfiability problem
problem of determining if a Boolean formula could be made true
Facts
4 properties- Subclass of
- decision problem
- Computational complexity
- NP-complete[7]
🏷️ Also known as
en propositional satisfiability problem
en boolean satisfiability problem
en SAT
en SATISFIABILITY
ar قابلية الإرضاء
ar مسألة استيفاء منطقية
cs SATISFIABILITY
cs SAT
cs Problém splnitelnosti booleovské formule
de Erfüllbarkeitsproblem der Aussagenlogik
de Erfüllbarkeitsproblem
de SAT-Solver
de Satisfiability
de SAT-Problem
es Problema de satisfabilidad booleana
es Problema de satisfabilidad
es problema de satisfacibilidad booleana
fa مسئله صدقپذیری دودویی
fa مسئلهٔ صدق پذیری دودویی
fa مسئله صدق پذیری دودویی
🔖 Identifiers · 7
- OpenAlex ID
- C6943359
- Encyclopædia Britannica Online ID
- topic/satisfiability-problem
- Freebase ID
- /m/01hmj
- MathWorld ID
- SatisfiabilityProblem
- Microsoft Academic ID (discontinued)
- 6943359
- Stack Exchange tag
- stackoverflow.com, or.stackexchange.com, cstheory.stackexchange.com
- Topic's main category
- Category:Satisfiability problems
🔗 Connections
Instance of 3
← Computes solution to 2
← Field of work 2
Belongs to 1
Computational complexity 1
Maintained by WikiProject 1
Part of 1
Subclass of 1
Subtypes 1
Topic's main category 1
← Category's main topic 1
← Different from 1
Press Enter · cited answer in seconds