Four different polynomial 3-SAT algorithms named A, B, C and D are provided:
v1: "Algorithm A": Obsolete, please ignore (paper has been left here for referring Internet links).
v2: "Algorithm B": Published in December 2013. Never failed for millions of test runs. Proof of correctness needs to be improved. Mr. M. Prunescu's paper 'About a surprizing computer program of Matthias Mueller' is about this Algorithm B.
v3: "Algorithm C": Obsolete, please ignore.
v4: "Algorithm D-1.0": Newest and best algorithm. Related paper v4 contains a detailed description of this polynomial 3-SAT solving algorithm, an extensive proof of correctness and a link where you can download my compiled demo C++ implementation (with source code) for Windows and Linux, an alternative polynomial solver version, and an additional tool program.
v5: "Algorithm D-1.1": Very same algorithm as v4, but better explained and with a re-written, completely new part of the Proof of Correctness.
v6: "Algorithm D-1.1": Some helpful improvements (compared to v5).
v7: "Algorithm D-1.2": Paper from May 22nd, 2016.
v8: "Algorithm D-1.3": Revised version. Parts of the proof of correctness have been replaced by a completely re-written, more detailed variant. Please read this version.
You might also want to visit www.louis-coder.com/Polynomial_3-SAT_Solver/Polynomial_3-SAT_Solver.htm for latest updates and news, and the zip file containing the Windows/Linux demo implementation.
Add your own feedback and questions here: You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.