A Polynomial Time Algorithm for a NPC Problem

08/09/2021

∙

by   Xinwen Jiang, et al.

∙

0

∙

share

It is introduced a so called 'Multi-stage graph Simple Path' problem (MSP for short) and proved that SAT problem can be polynomial reducible to MSP problem in this small paper. To solve MSP problem, we propose a polynomial time algorithm. Our result implies NP=P.