![]() | ![]() |
2008 | ||
---|---|---|
9 | EE | Sergey Gubin: On Subgraph Isomorphism CoRR abs/0802.2612: (2008) |
2007 | ||
8 | EE | Sergey Gubin: Reducing SAT to 2-SAT CoRR abs/0704.0108: (2007) |
7 | EE | Sergey Gubin: Finding Paths and Cycles in Graphs CoRR abs/0709.0974: (2007) |
6 | EE | Sergey Gubin: Set Matrices and The Path/Cycle Problem CoRR abs/0709.4273: (2007) |
5 | EE | Sergey Gubin: Convex and linear models of NP-problems CoRR abs/0711.0086: (2007) |
4 | EE | Sergey Gubin: A Polynomial Time Algorithm for 3-SAT CoRR abs/cs/0701023: (2007) |
3 | EE | Sergey Gubin: Polynomial time algorithm for 3-SAT. Examples of use CoRR abs/cs/0703098: (2007) |
2 | EE | Sergey Gubin: A Polynomial Time Algorithm for SAT CoRR abs/cs/0703146: (2007) |
2006 | ||
1 | EE | Sergey Gubin: A Polynomial Time Algorithm for The Traveling Salesman Problem CoRR abs/cs/0610042: (2006) |