A randomized, efficient algorithm for 3SAT

TL;DR

This paper introduces a randomized algorithm for 3SAT that builds on previous methods, providing strong probabilistic guarantees of finding solutions efficiently in polynomial time.

Contribution

It presents a new 3SAT algorithm based on earlier randomized approaches, with arguments supporting its high-probability polynomial-time performance.

Findings

Algorithm finds solutions with high probability

Operates in polynomial time

Builds on Papadimitriou and Schoning's methods

Abstract

In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also present strong arguments that this algorithm finds a solution (if it exists) for a 3SAT problem with high probability in polynomial time.