NP - P is not empty
计算复杂性
2016-09-27 v9 密码学与安全
摘要
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
引用
@article{arxiv.cs/0409039,
title = {NP - P is not empty},
author = {Marius Constantin Ionescu},
journal= {arXiv preprint arXiv:cs/0409039},
year = {2016}
}