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 iterates of our dynamical system are guaranteed to converge to a fixed point that is not necessarily an equilibrium but we show that a maximum clique can be computed enter a neighborhood of a fixed point.

翻译：在本文中,我们给出了一个关于最大分类问题的多边-时间算法,这意味着 P = NP。我们的算法基于对该问题的持续的游戏理论表达,其核心是一个离散的时空动态系统。我们动态系统的迭代被保证会汇合到一个固定点,而这个点不一定是一个平衡,但我们表明,可以计算出一个最大分类,进入一个固定点的附近。