1 paper
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 this paper, we investigate a descriptor approach b…