Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A Polynomial Time Algorithm for 3-SAT
A Polynomial Time Algorithm for SAT
A Polynomial Time Algorithm for The Traveling Salesman Problem
Finding Paths and Cycles in Graphs
On Subgraph Isomorphism
No associations
LandOfFree
Sergey Gubin does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Sergey Gubin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sergey Gubin will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-276947