Boolean satisfiability problem

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Boolean satisfiability problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Miguel Palomo, CC BY-SA 4.0, via Wikimedia Commons.