On the complexity of SAT
Computational Complexity
2022-03-23 v3 Formal Languages and Automata Theory
Authors:
Fabio Romano
Abstract
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
Keywords
Cite
@article{arxiv.2111.06967,
title = {On the complexity of SAT},
author = {Fabio Romano},
journal= {arXiv preprint arXiv:2111.06967},
year = {2022}
}
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
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
Ian Christopher, Dennis Huo, Bryan Jacobs
2008-04-18
Computational Complexity · Computer Science
Polynomial Time Algorithm for Boolean Satisfiability Problem
Stepan G. Margaryan
2023-11-01
General Mathematics · Mathematics
On the existence of polynomial-time algorithms to the subset sum problem
Jorma Jormakka
2020-11-23
Computational Complexity · Computer Science
Lower bound for the Complexity of the Boolean Satisfiability Problem
Carlos Barrón-Romero
2016-04-15
Computational Complexity · Computer Science
Three complete deterministic polynomial algorithms for 3SAT
Charles Sauerbier
2019-12-16
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
Computational Complexity · Computer Science
Algorithm that Solves 3-SAT in Polynomial Time
Jason W. Steinmetz
2015-06-04
Computational Complexity · Computer Science
Does P = NP?
C. Sauerbier
2009-11-30
Computational Complexity · Computer Science
A simple way to reduce factorization problems to SAT
Davide Maran
2020-04-29
Computational Complexity · Computer Science
On SAT information content, its polynomial-time solvability and fixed code algorithms
Maciej Drozdowski
2024-07-26
Computational Complexity · Computer Science
A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
Nicholas DeJesse, Spencer Lyudovyk, Dhruv Pai
2025-10-28
Quantum Physics · Physics
NP problem in quantum algorithm
Masanori Ohya, Natsuki Masuda
2008-11-26
Emerging Technologies · Computer Science
Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
S. R. B. Bearden, Y. R. Pei, M. Di Ventra
2020-11-13
Computational Complexity · Computer Science
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem."
Michael C. Chavrimootoo, Henry B. Welles
2021-12-14
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3-SAT
Sergey Gubin
2008-07-15
Computational Complexity · Computer Science
Classical and Quantum Algorithms for the Boolean Satisfiability Problem
Carlos Barrón-Romero
2016-02-22
Data Structures and Algorithms · Computer Science
Polynomial time factoring algorithm using Bayesian arithmetic
Michel Feldmann
2012-12-21
Quantum Physics · Physics
A linear time algorithm for quantum 2-SAT
Niel de Beaudrap, Sevag Gharibian
2016-10-25
Computational Complexity · Computer Science
The 3-satisfiability problem
Amar Mukherjee
2012-01-09
Computational Complexity · Computer Science
Understanding model counting for $\beta$-acyclic CNF-formulas
Johann Brault-Baron, Florent Capelli, Stefan Mengel
2014-05-26
Machine Learning · Computer Science
Self-Satisfied: An end-to-end framework for SAT generation and prediction
Christopher R. Serrano, Jonathan Gallagher, Kenji Yamada, Alexei Kopylov +1
2024-10-22
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Data Structures and Algorithms · Computer Science
On the Parameterized Complexity of Diverse SAT
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
2024-12-16
Computational Complexity · Computer Science
A Counterexample to a Proposed Proof of P=NP by S. Gubin
Blake Hegerle
2007-05-23