[Note: See addendum prefacing this paper, as a hole has been determined to exist in the algorithm as presented in this paper.] 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… (More)

@article{Sauerbier2002APT,
title={A polynomial time (heuristic) SAT algorithm},
author={Charles Sauerbier},
journal={CoRR},
year={2002},
volume={cs.CC/0205064}
}