PaperThe complexity analysis ignores all efficiencies.
GithubA serial C++ version with trivial efficiencies is available at GitHub which determines satisfiability only. We fairly call this version naive, although it does provide the most insight for study.
An optimized C code version exists, that will construct a solution for a satisfiable 3-SAT. It has the same polynomial bound.
GeneralizationThe deterministic polynomial time algorithm that determines satisfiability of 3-SAT can be generalized for SAT.
Special thanks and acknowledgements to: Ge Baolai of SHARCNET and Steven Beauchemin from the University of Western Ontario.