  In this paper, we provide a deterministic polynomial time algorithm that
determines satisfiability of 3-SAT. The complexity analysis for the algorithm
takes into account no efficiency and yet provides a low enough bound, that
efficient versions are practical with respect to today's hardware. We accompany
this paper with a serial version of the algorithm without non-trivial
efficiencies (link: polynomial3sat.org).
