  Three algorithms are presented that determine the existence of satisfying
assignments for 3SAT Boolean satisfiability expressions. One algorithm is
presented for determining an instance of a satisfying assignment, where such
exists. The algorithms are each deterministic and of polynomial complexity. The
algorithms determining existence are complete as each produces a certificate of
non-satisfiability, for instances where no satisfying assignment exists, and of
satisfiability for such assignment does exist.
