A Polynomial Time Algorithm for a NPC Problem

08/09/2021
by   Xinwen Jiang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2018

Non-Interlaced SAT is in P

We investigate the NP-Complete problem SAT and the geometry of its insta...
research
10/26/2017

A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

This paper presents the first polynomial time algorithm to compute geode...
research
05/13/2020

A Polynomial-Time Algorithm for Optimization of Quadratic Pseudo-Boolean Functions

We develop a polynomial-time algorithm to minimize pseudo-Boolean functi...
research
07/30/2019

Atomic Embeddability, Clustered Planarity, and Thickenability

We study the atomic embeddability testing problem, which is a common gen...
research
02/11/2020

A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors

The Graph Isomorphism (GI) problem is a theoretically interesting proble...
research
02/19/2022

A Quantum Polynomial-Time Solution to The Dihedral Hidden Subgroup Problem

We present a polynomial-time quantum algorithm for the Hidden Subgroup P...
research
06/12/2018

Exponential Weights on the Hypercube in Polynomial Time

We address the online linear optimization problem when the decision set ...

Please sign up or login with your details

Forgot password? Click here to reset