Timeline for Complexity of deciding if a formula has exactly 1 satisfying assignment
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2013 at 18:38 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 48 characters in body
|
| Aug 25, 2013 at 18:21 | history | edited | Juho | CC BY-SA 3.0 |
added 21 characters in body
|
| Aug 25, 2013 at 18:10 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 353 characters in body
|
| Aug 25, 2013 at 14:05 | history | edited | Juho | CC BY-SA 3.0 |
added 403 characters in body
|
| Aug 23, 2013 at 16:44 | history | edited | Juho | CC BY-SA 3.0 |
edited body
|
| Aug 23, 2013 at 13:46 | history | edited | Juho | CC BY-SA 3.0 |
added 913 characters in body
|
| Aug 23, 2013 at 13:38 | comment | added | sdcvvc | Thanks for the answer; I also found a chapter in a book saying existence of a deterministic reduction is open. | |
| Aug 23, 2013 at 13:32 | vote | accept | sdcvvc | ||
| Aug 23, 2013 at 13:22 | history | answered | Juho | CC BY-SA 3.0 |