Timeline for Density of distinct satisfying assignments for uniquely satisfiable formulas
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2012 at 17:40 | history | tweeted | twitter.com/#!/StackCSTheory/status/184696288057634817 | ||
| Mar 21, 2012 at 18:03 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 167 characters in body
|
| Mar 21, 2012 at 17:16 | answer | added | Sajin Koroth | timeline score: 5 | |
| Mar 21, 2012 at 16:07 | comment | added | Mohammad Al-Turkistany | Does your construction work for 3CNF clauses with three distinct leterals? | |
| Mar 21, 2012 at 15:57 | comment | added | Tsuyoshi Ito | I need n variables, of course, but I do not know what you mean. According to your definition, an n-bit string can result only from an n-variable 3CNF formula. | |
| Mar 21, 2012 at 15:49 | comment | added | Mohammad Al-Turkistany | In your construction, how many variables do you need for n-bit strings? | |
| Mar 21, 2012 at 14:24 | comment | added | Tsuyoshi Ito | For every truth assignment x, there exists a 3CNF formula whose unique satisfying assignment is x, meaning that the range of your function consists of all n-bit strings. Not sure if this is what you are asking about. | |
| Mar 21, 2012 at 14:03 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 7 characters in body
|
| Mar 21, 2012 at 13:56 | history | asked | Mohammad Al-Turkistany | CC BY-SA 3.0 |