# Determining satisfiability of 3-SAT in polynomial time

## TL;DR

This paper claims to present a deterministic polynomial time algorithm for solving 3-SAT, a problem previously thought to be NP-complete, suggesting a breakthrough in computational complexity theory.

## Contribution

It introduces a novel polynomial time algorithm for 3-SAT, challenging the long-standing belief that 3-SAT is NP-complete.

## Key findings

- Algorithm runs in polynomial time
- Practical efficiency demonstrated on current hardware
- Provides a serial implementation for testing

## Abstract

In this paper, we provide a deterministic polynomial time 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: polynomial3sat.org).