Live briefing
Everything about 2-satisfiability
Logic problem, AND of pairwise ORs
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. It is a special case of the general Boolean satisfiability problem, which can involve constraints on more than two variables, and of constraint satisfaction problems, which can allow more than two choices for the value of each variable. But in contrast to those more general problems, which are NP-complete, 2-satisfiability can be solved in polynomial time. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: 2-satisfiabilityA 5-minute orientation
- Skim a recent paper: Weighted Random k Satisfiability for k = 1 , 2 (r2SAT) in Discrete Hopfield Neural NetworkInfluential work since 2022
- Pick up a classic book: The art of computer programmingThe most-reprinted book on the subject
- Read the landmark paper: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingCited 2,527 times
- Go sideways: Maximum satisfiability problemA closely related topic
- Go sideways: Conflict-driven clause learningA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
GRASP: a search algorithm for propositional satisfiability
Analytic and Algorithmic Solution of Random Satisfiability Problems
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Test pattern generation using Boolean satisfiability
Bounded Model Checking Using Satisfiability Solving
Satisfiability modulo theories
Critical Behavior in the Satisfiability of Random Boolean Expressions
🆕 Influential since 2022
Weighted Random k Satisfiability for k = 1 , 2 (r2SAT) in Discrete Hopfield Neural Network
A modified reverse-based analysis logic mining model with Weighted Random 2 Satisfiability logic in Discrete Hopfield Neural Network and multi-objective training of Modified Niched Genetic Algorithm
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
YRAN2SAT: A novel flexible random satisfiability logical rule in discrete hopfield neural network
Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization
📚 Books worth reading
The art of computer programmingDonald Knuth · 1922- 📕Pressure Cooker CookbookVanessa Olsen · 2016
- 📕A manuell of the Arch-Confraternitie of the Cord of the Passion, instituted in the seraphicall order of S. Francis ..Angelus à Sancto Francisco · 1654
Make your plans now to buy money-making cattle in the annual fall auction saleHal Longley · 1943
Honour satisfiedFrank Warren · 1990- 📕"The sale of satisfied buyers"West Central Illinois Shorthorn Association, Wayne Caldwell Neely Collection of Shorthorn Cattle Catalogs · 1974
- 📕Newport Coast Series Books 1 And 2Kelsey MacBride · 2022
"The sale of satisfied buyers," always a dependable source of supply-Hal Longley · 1946
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Maximum satisfiability problem In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given…
- Conflict-driven clause learning In computer science, conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula…
- Cook–Levin theorem In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete…
- ♯SAT In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretati…
- Boolean satisfiability problem In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY…
- Boolean satisfiability algorithm heuristics In computer science, there are certain classes of algorithms (heuristics) that solves types of the Boolean satisfiability problem despite there being no…
- Circuit satisfiability problem In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining…
- DPLL algorithm In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the…