A Polynomial Time Algorithm for 3-SAT

Abstract

Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.

9 pages. The version consolidates results and shares know-how

References in corpus (2)

• A Polynomial Time Algorithm for The Traveling Salesman Problem
• A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin

Cited by in corpus (2)

• On Subgraph Isomorphism
• Reducing SAT to 2-SAT