Timeline for Attempt to find a real number whose computation of bits is NP-complete
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14 at 9:23 | answer | added | Emil Jeřábek | timeline score: 2 | |
| Oct 13 at 23:59 | answer | added | zinc_11010 | timeline score: 1 | |
| Oct 11 at 10:38 | comment | added | rus9384 | Asking if the amount of solutions is odd is a problem in $\oplus\mathsf P$, which is not known to be either a subset or a superset of $\mathsf{NP}$. To make it belong to $\mathsf{NP}$, you have to ask if there is at least $1$ (or $k$ that is a number polynomial in $n$) solution. | |
| Oct 11 at 7:06 | comment | added | orlp |
A problem count(X) being #P-complete does not mean that count(X) % 2 == 1 is NP-complete.
|
|
| Oct 10 at 22:32 | history | asked | Dannyu NDos | CC BY-SA 4.0 |