Data Structures and Algorithms


Determining Satisfiability of 3-Sat in Polynomial Time

Authors: Ortho Flint, Asanka Wickramasinghe, Jay Brasse, Chris Fowler

In this paper, we provide a polynomial time (and space), 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:

Comments: 42 Pages. Version 1 is missing a case in the theorem. Version 2 is complete.

Download: PDF

Submission history

[v1] 2019-08-31 14:28:23
[v2] 2019-10-05 11:23:08

Unique-IP document downloads: 23 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus