4 citations · 7 across the 6 of their papers we have counts for
1 paper · 2 filters
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…