Timeline for answer to Statements that imply $\mathbf{P}\neq \mathbf{NP}$ by vzn
Current License: CC BY-SA 3.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2018 at 21:27 | comment | added | DukeZhou | Thanks for the Jukna link! "Complexity is one of the crucial scientific phenomena of our times. In this chapter we consider the complexity of graphs." | |
| Dec 9, 2016 at 2:45 | comment | added | Yonatan N | Yep. Even P/poly is known to contain problems outside of P, like the unary halting problem. | |
| Dec 4, 2016 at 10:18 | comment | added | Turbo | @YonatanN $P\neq NP/poly$ is true? | |
| Oct 15, 2014 at 19:33 | comment | added | Yonatan N | I think you mean $P/poly \not \supset NP$. The statement $P \neq NP/poly$ already trivially known. | |
| Oct 10, 2014 at 18:42 | history | answered | vzn | CC BY-SA 3.0 |