2 citations · 5 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2007
Reducing SAT to 2-SAT
Sergey Gubin
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
cs.CC2007★ 2 cited
Polynomial time algorithm for 3-SAT. Examples of use
Sergey Gubin
The algorithm checks the propositional formulas for patterns of unsatisfiability.
cs.CC2007★ 2 cited
A Polynomial Time Algorithm for 3-SAT
Sergey Gubin
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.