It looks like the paper is fairly straightforward. It purports to give a polynomial time algorithm for 3-SAT. Interesting facts: - It is a O(n^4m) algorithm,

It looks like the paper is fairly straightforward. It purports to give a polynomial time algorithm for 3-SAT. Interesting facts: - It is a O(n^4m) algorithm, where n is the number of boolean variables and m is the number of disjunctions. - It not only tells you whether the formula is satisfiable or not, but gives you the satisfying values. - The author claims to have implemented and tested the algorithm on reasonably sized problems, though I don't see his code posted anywhere (?). Someone else appears to have implemented it here: https://github.com/anjlab/sat3 https://github.com/anjlab/sat3. - The author references no prior work, just review papers on the problem itself.