J. Barthélemy

activity

20162021

most citedInteraction prediction between groundwater and quarry extension using discrete choice models and artificial neural networks

4 citations · 7 across the 6 of their papers we have counts for

collaborators

Showing 2020Show all

1 paper · 1 filter

cs.CC2020

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

Marcel Rémon, Johan Barthélemy

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

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

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