NP - P is not empty
Computational Complexity
2016-09-27 v9 Cryptography and Security
Abstract
We present the MEoP problem that decides the existence of solutions to certain modular equations over prime numbers and show how this separates the complexity class NP from its subclass P
Cite
@article{arxiv.cs/0409039,
title = {NP - P is not empty},
author = {Marius Constantin Ionescu},
journal= {arXiv preprint arXiv:cs/0409039},
year = {2016}
}