The 3-satisfiability problem
Computational Complexity
2012-01-09 v2
Authors:
Amar Mukherjee
Abstract
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.
Cite
@article{arxiv.1104.4490,
title = {The 3-satisfiability problem},
author = {Amar Mukherjee},
journal= {arXiv preprint arXiv:1104.4490},
year = {2012}
}
Comments
This paper is withdrawn by the author because a revision has been developed
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Determining satisfiability of 3-SAT in polynomial time
Ortho Flint, Asanka Wickramasinghe, Jason Brasse, Christopher Fowler
2020-07-02
Computational Complexity · Computer Science
Algorithm that Solves 3-SAT in Polynomial Time
Jason W. Steinmetz
2015-06-04
Computational Complexity · Computer Science
Polynomial time algorithm for 3-SAT. Examples of use
Sergey Gubin
2007-05-23
Computational Complexity · Computer Science
Three complete deterministic polynomial algorithms for 3SAT
Charles Sauerbier
2019-12-16
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Computational Complexity · Computer Science
An Improved Exact Algorithm for the Domatic Number Problem
Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
2007-05-23
Optimization and Control · Mathematics
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
Manuel Bodirsky, Marcello Mamino, Caterina Viola
2020-03-03
Computational Complexity · Computer Science
Solution of the Linear Ordering Problem (NP=P)
Givi Bolotashvili
2007-05-23
Data Structures and Algorithms · Computer Science
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2014-07-11
Computational Complexity · Computer Science
Classical and Quantum Algorithms for the Boolean Satisfiability Problem
Carlos Barrón-Romero
2016-02-22
Computational Complexity · Computer Science
Solving satisfiability by Bayesian inference
Michel Feldmann
2020-02-05
Computational Complexity · Computer Science
A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time
Giacomo Patrizi
2018-01-31
Computational Complexity · Computer Science
Polynomial Time Algorithm for Boolean Satisfiability Problem
Stepan G. Margaryan
2023-11-01
Optimization and Control · Mathematics
A polynomially solvable case of the pooling problem
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
2017-02-09
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3-SAT
Sergey Gubin
2008-07-15
Computational Complexity · Computer Science
Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
Chee-Khian Sim
2025-12-24
Computational Complexity · Computer Science
Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem
Jerrald Meek
2008-09-07
Computational Complexity · Computer Science
Polynomial-time Tractable Problems over the $p$-adic Numbers
Arno Fehm, Manuel Bodirsky
2025-04-21
Computational Complexity · Computer Science
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie
2024-04-09
Optimization and Control · Mathematics
A note on polynomial solvability of the CDT problem
Daniel Bienstock
2015-02-24
Quantum Physics · Physics
New quantum algorithm for studying NP-complete problems
Masanori Ohya, Igor V. Volovich
2015-06-26
Computational Complexity · Computer Science
A Proof of the CSP Dichotomy Conjecture
Dmitriy Zhuk
2020-10-05
Computational Complexity · Computer Science
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
Ian Christopher, Dennis Huo, Bryan Jacobs
2008-04-18
Probability · Mathematics
Polynomial time algorithm for optimal stopping with fixed accuracy
David A. Goldberg, Yilun Chen
2024-05-16
Computational Complexity · Computer Science
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem
Tobias Riege, Jörg Rothe
2007-05-23