NP - P is not empty
<|reference_start|>NP - P is not empty: 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<|reference_end|>
@article{ionescu2004np,
    title={NP - P is not empty},
    author={Marius Constantin Ionescu},
    journal={arXiv preprint arXiv:cs/0409039},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0409039},
    primaryClass={cs.CC cs.CR}
}