Hard 3-CNF-SAT problems are in $P$ -- A first step in proving $NP=P$

Marcel Rémon, Johan Barthélemy

The relationship between the complexity classes $P$ and $NP$ is an unsolved question in the field of theoretical computer science. In the first part of this paper, a lattice framew…