Timeline for Is SAT in P if there are exponentially many clauses in the number of variables?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2012 at 9:15 | vote | accept | Numerator | ||
| Jul 21, 2012 at 19:09 | comment | added | Raphael | @TsuyoshiIto: We try to keep on top of weird tags. Please feel free to edit the occasional occurrence. If you spot wide-spread (mis)use or meet opposition, please take it to meta (rather than discussing in the comments below a question). | |
| Jul 21, 2012 at 19:06 | answer | added | Raphael | timeline score: 7 | |
| Jul 21, 2012 at 18:44 | history | edited | Raphael | CC BY-SA 3.0 |
edited title
|
| Jul 16, 2012 at 23:38 | history | edited | Kaveh |
edited tags
|
|
| Jul 13, 2012 at 7:37 | history | tweeted | twitter.com/#!/StackCompSci/status/223682632930697217 | ||
| Jul 13, 2012 at 0:02 | comment | added | Tsuyoshi Ito | @Numerator: Watch out in the last sentence in the question. Reducing an easy problem (2-SAT in this case) to your problem does not mean that your problem is easy. | |
| Jul 12, 2012 at 9:50 | history | edited | Juho | CC BY-SA 3.0 |
formatting
|
| Jul 12, 2012 at 9:04 | answer | added | Luke Mathieson | timeline score: 12 | |
| Jul 12, 2012 at 8:19 | history | asked | Numerator | CC BY-SA 3.0 |