2 citations · 5 across the 6 of their papers we have counts for
6 papers
cs.DM2007
Convex and linear models of NP-problems
Sergey Gubin
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
cs.DM2007
Set Matrices and The Path/Cycle Problem
Sergey Gubin
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
cs.DM2007★ 1 cited
Finding Paths and Cycles in Graphs
Sergey Gubin
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
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.