Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Gubin, Sergey"'
Autor:
Simonenko, Elizaveta P. *, Simonenko, Nikolay P., Kolesnikov, Anatoly F., Chaplygin, Aleksey V., Lysenkov, Anton S., Nagornov, Ilya A., Simonenko, Tatiana L., Gubin, Sergey P., Sevastyanov, Vladimir G., Kuznetsov, Nikolay T.
Publikováno v:
In Journal of the European Ceramic Society January 2022 42(1):30-42
Autor:
Simonenko, Elizaveta P., Mokrushin, Artem S., Simonenko, Nikolay P., Voronov, Vsevolod A., Kim, Vitalii P., Tkachev, Sergey V., Gubin, Sergey P., Sevastyanov, Vladimir G., Kuznetsov, Nikolay T.
Publikováno v:
In Thin Solid Films 31 January 2019 670:46-53
Autor:
Gubin, Sergey
Publikováno v:
Polynomial size asymmetric linear model for Subgraph Isomorphism, Proceedings WCECS 2008, ISBN: 978-988-98671-0-2, pp.241-246
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
Comment: Simplified, 6 pages
Comment: Simplified, 6 pages
Externí odkaz:
http://arxiv.org/abs/0802.2612
Autor:
Gubin, Sergey
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
Comment: In part, the results were presented on WCECS 2007/ICCSA 2007. V2 edited
Comment: In part, the results were presented on WCECS 2007/ICCSA 2007. V2 edited
Externí odkaz:
http://arxiv.org/abs/0711.0086
Autor:
Gubin, Sergey
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
Comment: 7 pages
Comment: 7 pages
Externí odkaz:
http://arxiv.org/abs/0709.4273
Autor:
Gubin, Sergey
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Comment: 11 pages
Comment: 11 pages
Externí odkaz:
http://arxiv.org/abs/0709.0974
Autor:
Gubin, Sergey
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
Comment: 8 pages
Comment: 8 pages
Externí odkaz:
http://arxiv.org/abs/0704.0108
Autor:
Gubin, Sergey
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 techniqu
Externí odkaz:
http://arxiv.org/abs/cs/0703146
Autor:
Gubin, Sergey
The algorithm checks the propositional formulas for patterns of unsatisfiability.
Comment: 19 pages
Comment: 19 pages
Externí odkaz:
http://arxiv.org/abs/cs/0703098
Autor:
Gubin, Sergey
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
Comment: 9 pages. The version consolidates results and shares know-how
Comment: 9 pages. The version consolidates results and shares know-how
Externí odkaz:
http://arxiv.org/abs/cs/0701023