Poising on Ariadne's thread: An algorithm for computing a maximum clique in polynomial time
Computer Science and Game Theory
2021-11-05 v9 Computational Complexity
Abstract
In this paper, we present a polynomial-time algorithm for the maximum clique problem, which implies P = NP. Our algorithm is based on a continuous game-theoretic representation of this problem and at its heart lies a discrete-time dynamical system. The rule of our dynamical system depends on a parameter such that if this parameter is equal to the maximum-clique size, the iterates of our dynamical system are guaranteed to converge to a maximum clique.
Cite
@article{arxiv.2008.06167,
title = {Poising on Ariadne's thread: An algorithm for computing a maximum clique in polynomial time},
author = {Ioannis Avramopoulos},
journal= {arXiv preprint arXiv:2008.06167},
year = {2021}
}