The 3-satisfiability problem

2011/04/22 by Amar Mukherjee, Mukherjee, Amar
Computer Science · #Advanced Graph Theory Research #semigroups and automata theory #Constraint Satisfaction and Optimization

paper · pdf · doi:10.48550/arxiv.1104.4490

Abstract

We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.

Related

• Determining satisfiability of 3-SAT in polynomial time
• Algorithm that Solves 3-SAT in Polynomial Time
• Polynomial time algorithm for 3-SAT. Examples of use
• Three complete deterministic polynomial algorithms for 3SAT
• A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT