Timeline for Are there any FNP-complete problems with a unique solution?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2021 at 4:53 | history | edited | Yair Halberstadt | CC BY-SA 4.0 | added 97 characters in body |
| Nov 18, 2021 at 4:52 | history | undeleted | Yair Halberstadt | ||
| Nov 18, 2021 at 4:13 | history | deleted | Yair Halberstadt | via Vote | |
| Nov 18, 2021 at 4:10 | comment | added | Yair Halberstadt | He also claims to have proven P = NP. I'm going to dismiss him as crank, although the proof for UP = NP seems reasonable, but I'll have to check through it more carefully. | |
| Nov 17, 2021 at 22:41 | comment | added | Steven | Interesting. Has the paper been peer-reviewed and published somewhere? The same author also claims to have proved that $P \neq NP$... | |
| Nov 17, 2021 at 16:02 | history | edited | Yair Halberstadt | CC BY-SA 4.0 | deleted 10 characters in body |
| S Nov 17, 2021 at 15:21 | review | First answers | |||
| Nov 18, 2021 at 1:31 | |||||
| S Nov 17, 2021 at 15:21 | history | answered | Yair Halberstadt | CC BY-SA 4.0 |