Timeline for What happens for factoring algorithms if P=NP?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2018 at 18:37 | history | edited | kelalaka | CC BY-SA 4.0 |
typos and corrections.
|
| Nov 5, 2018 at 16:27 | history | edited | kelalaka | CC BY-SA 4.0 |
applied Davis's comment
|
| Nov 5, 2018 at 16:23 | comment | added | David Richerby | Yours second paragraph talks about "[solving] the famous open problem $\mathbf{P}=\mathbf{NP}$ or $\mathbf{P}\neq\mathbf{NP}$." I'm saying that's a trivial problem and it would be better to say that $x$ proves that $\mathbf{P}=\mathbf{NP}$. | |
| Nov 5, 2018 at 16:21 | comment | added | kelalaka | @DavidRicherby yes, exactly. The wording is wrong here? | |
| Nov 5, 2018 at 16:16 | comment | added | David Richerby | The law of excluded middle already tells us that $\mathbf{P}=\mathbf{NP}$ or $\mathbf{P}\neq\mathbf{NP}\,$! So, presumably, $x$ is a problem that proves $\mathbf{P}=\mathbf{NP}$. | |
| Nov 5, 2018 at 12:59 | history | edited | kelalaka | CC BY-SA 4.0 |
explain more about the reductions.
|
| Nov 5, 2018 at 12:17 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Nov 5, 2018 at 12:00 | history | answered | kelalaka | CC BY-SA 4.0 |