How to solve kSAT in polynomial time
Computational Complexity
2012-04-03 v2
Authors:
Algirdas Antano Maknickas
Abstract
With using of multi-nary logic analytic formulas proposition that "kSAT is in P and could be solved in O(n3.5)" was proved
Cite
@article{arxiv.1203.6020,
title = {How to solve kSAT in polynomial time},
author = {Algirdas Antano Maknickas},
journal= {arXiv preprint arXiv:1203.6020},
year = {2012}
}
Related papers
View all related →
Computational Complexity · Computer Science
Method of resolution of 3SAT in polynomial time
Luigi Salemi
2010-09-14
Quantum Physics · Physics
A linear time algorithm for quantum 2-SAT
Niel de Beaudrap, Sevag Gharibian
2016-10-25
Data Structures and Algorithms · Computer Science
A Polynomial Decision for 3-SAT
Angela Weiss
2024-06-11
Data Structures and Algorithms · Computer Science
A Polynomial time Algorithm for 3SAT
Lizhi Du
2026-04-23
Data Structures and Algorithms · Computer Science
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
2015-03-19
Quantum Physics · Physics
Efficient algorithm for a quantum analogue of 2-SAT
Sergey Bravyi
2007-05-23
Computational Complexity · Computer Science
Algorithm that Solves 3-SAT in Polynomial Time
Jason W. Steinmetz
2015-06-04
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3-SAT
Sergey Gubin
2008-07-15
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
Polynomial time algorithm for 3-SAT. Examples of use
Sergey Gubin
2007-05-23
Computational Complexity · Computer Science
A criterion for "easiness" of certain SAT problems
Bernd R. Schuh
2017-07-04
Computational Complexity · Computer Science
Solving QSAT in sublinear depth
Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca +1
2019-02-13
Quantum Physics · Physics
NP problem in quantum algorithm
Masanori Ohya, Natsuki Masuda
2008-11-26
Computational Complexity · Computer Science
Non-Interlaced SAT is in P
Dr Serge Burckel
2019-03-26
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3SAT
Robert Quigley
2024-06-14
Combinatorics · Mathematics
A better algorithm for random k-SAT
Amin Coja-Oghlan
2017-11-17
Computational Complexity · Computer Science
A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
Nicholas DeJesse, Spencer Lyudovyk, Dhruv Pai
2025-10-28
Computational Complexity · Computer Science
Analysis of the postulates produced by Karp's Theorem
Jerrald Meek
2008-09-03
Computational Complexity · Computer Science
On the complexity of probabilistic trials for hidden satisfiability problems
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha +2
2016-06-14
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
Data Structures and Algorithms · Computer Science
A new algorithm for Solving 3-CNF-SAT problem
Belal Qasemi
2017-04-07
Computational Complexity · Computer Science
An exact algorithm for 1-in-3 SAT
Édouard Bonnet, Vangelis Th. Paschos
2013-07-30
Data Structures and Algorithms · Computer Science
An algorithm for 3-SAT problems
Hiroshi Tsukimoto
2017-08-01
Data Structures and Algorithms · Computer Science
A Full Derandomization of Schoening's k-SAT Algorithm
Robin A. Moser, Dominik Scheder
2010-08-25
Computational Complexity · Computer Science
Solving satisfiability by Bayesian inference
Michel Feldmann
2020-02-05