Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Oh, so you mean like, supposing that NPI exists, an NPI problem? https://en.wikipedia.org/wiki/NP-intermediate

> There are harder problems in NP

That is an unresolved question. It might turn out that every problem in NP is equally hard. (Up to a polynomial translation cost.)



Thanks for the better information!




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: