A Polynomial Time SAT Algorithm
Charles Sauerbier · arXiv (Cornell University) · 2002
An algorithm of two parts is presented that determines existence of and instance of an assignment satisfying of instances of SAT. The algorithm employs an unconventional approach premised on set theory, which does not use search or resolution, to partition the set of all assignments into nonsatisfying and satisfying assignments. The algorithm, correctness, and time and space complexity proofs are given.