3 papers
cs.CC2020
Hard 3-CNF-SAT problems are in -- A first step in proving
Marcel Rémon, Johan Barthélemy
The relationship between the complexity classes and is an unsolved question in the field of theoretical computer science. In the first part of this paper, a lattice framew…
stat.ME2010
"Additivity" versus "Maxitivity" at the heart of the paradoxical and efficient nature of Statistics
M. Rémon
Unlike the Probability Theory based on additivity, Statistical Inference seems to hesitate between "Additivity" and a so-called "Maxitivity" approach. After a brief overview of thr…
cs.CC2009
About the impossibility to prove P=NP and the pseudo-randomness in NP
M. Rémon
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP…