arXiv subjects
Publications and source records attributed to 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, we draft problems and solve them utilizing the image creation technique. The method reveals: P = NP = PSPACE
The ATSP polytope can be expressed by asymmetric polynomial size linear program.
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
The algorithm checks the propositional formulas for patterns of unsatisfiability.