AI Chat AI Image Generator AI Video Text to Speech

Determining satisfiability of 3-SAT in polynomial time

03/24/2019

∙

by Ortho Flint, et al.

∙

∙

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.

Ortho Flint
1 publication
Asanka Wickramasinghe
1 publication
Jason Brasse
1 publication
Christopher Fowler
1 publication

research

∙ 08/08/2018

Positive 1-in-3-SAT admits a non-trivial kernel

This paper illustrates the power of Gaussian Elimination by adapting it ...

0 Valentin Bura, et al. ∙

research

∙ 08/20/2022

A Polynomial Decision for 3-SAT

We propose a polynomially bounded, in time and space, method to decide w...

0 Angela Weiss, et al. ∙

research

∙ 09/14/2022

Automated Synthesis of Asynchronizations

Asynchronous programming is widely adopted for building responsive and e...

0 Sidi Mohamed Beillahi, et al. ∙

research

∙ 01/12/2018

A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time

Any satisfiability problem in conjunctive normal form can be solved in p...

0 Giacomo Patrizi, et al. ∙

research

∙ 02/26/2019

Arithmetic Progressions of Length Three in Multiplicative Subgroups of F_p

In this paper, we give an algorithm for detecting non-trivial 3-APs in m...

0 Jeremy F Alm, et al. ∙

research

∙ 03/21/2022

The Todd-Coxeter Algorithm for Semigroups and Monoids

In this paper we provide an account of the Todd-Coxeter algorithm for co...

0 T. D. H. Coleman, et al. ∙

research

∙ 07/24/2013

A novel approach of solving the CNF-SAT problem

In this paper, we discussed CNF-SAT problem (NP-Complete problem) and an...

0 Xili Wang, et al. ∙