Reducing SAT to 2-SAT
Computational Complexity
2007-05-23 v1
Authors:
Sergey Gubin
Abstract
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
Cite
@article{arxiv.0704.0108,
title = {Reducing SAT to 2-SAT},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:0704.0108},
year = {2007}
}
Comments
8 pages
Related papers
View all related →
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3-SAT
Sergey Gubin
2008-07-15
Computational Complexity · Computer Science
A simple way to reduce factorization problems to SAT
Davide Maran
2020-04-29
Computational Complexity · Computer Science
Polynomial time algorithm for 3-SAT. Examples of use
Sergey Gubin
2007-05-23
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
A Polynomial Time Algorithm for SAT
Sergey Gubin
2012-05-08
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
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
Discrete Mathematics · Computer Science
Submodular problems - approximations and algorithms
Dorit S. Hochbaum
2017-05-01
Computational Complexity · Computer Science
On SAT information content, its polynomial-time solvability and fixed code algorithms
Maciej Drozdowski
2024-07-26
Quantum Physics · Physics
Efficient algorithm for a quantum analogue of 2-SAT
Sergey Bravyi
2007-05-23
Quantum Physics · Physics
A linear time algorithm for quantum 2-SAT
Niel de Beaudrap, Sevag Gharibian
2016-10-25
Computational Complexity · Computer Science
Method of resolution of 3SAT in polynomial time
Luigi Salemi
2010-09-14
Dynamical Systems · Mathematics
Generalized "second Ritt theorem" and explicit solution of the polynomial moment problem
F. Pakovich
2010-06-28
Artificial Intelligence · Computer Science
Reducing SAT to Max2XOR
Carlos Ansótegui, Jordi Levy
2022-04-06
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
Optimization and Control · Mathematics
Compact linear programs for 2SAT
David Avis, Hans Raj Tiwary
2018-04-19
Computational Complexity · Computer Science
Non-Interlaced SAT is in P
Dr Serge Burckel
2019-03-26
Number Theory · Mathematics
On the irreducible factors of a polynomial II
Anuj Jakhar, Srinivas Koytada
2020-08-03
Computational Complexity · Computer Science
An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem
Wenxia Guo, Jin Wang, Majun He, Xiaoqin Ren +2
2018-03-28
Computational Complexity · Computer Science
Polynomial time estimates for #SAT
Bernd R. Schuh
2017-05-17
Data Structures and Algorithms · Computer Science
A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall +2
2026-04-22
Optimization and Control · Mathematics
Split cuts in the plane
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2020-11-12
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3SAT
Robert Quigley
2024-06-14
Computational Complexity · Computer Science
An exact algorithm for 1-in-3 SAT
Édouard Bonnet, Vangelis Th. Paschos
2013-07-30