6 citations · 11 across the 7 of their papers we have counts for
8 papers
Convex and linear models of NP-problems
Sergey Gubin
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
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.
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).
Reducing SAT to 2-SAT
Sergey Gubin
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
Polynomial time algorithm for 3-SAT. Examples of use
Sergey Gubin
The algorithm checks the propositional formulas for patterns of unsatisfiability.
A Polynomial Time Algorithm for SAT
Sergey Gubin
Article presents the compatibility matrix method and illustrates it with the application to P vs NP problem. The method is a generalization of descriptive geometry: in the method,…