Rare card
Boolean satisfiability problem
- Value
- 50 W
- Attack
- 289
- Defence
- 231
- Players
- 0
In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) asks whether there exists an interpretation that satisfies a given Boolean formula.
Get Boolean satisfiability problem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack