Timeline for Show that the SAT Problem for CNF formulas with at most two occurences of each variable can be solved in polynomial time
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 27 at 7:18 | history | edited | xskxzr | CC BY-SA 4.0 |
typo rectified
|
| S Aug 27 at 7:18 | history | suggested | 108_mk | CC BY-SA 4.0 |
typo rectified
|
| Aug 22 at 14:40 | review | Suggested edits | |||
| S Aug 27 at 7:18 | |||||
| Apr 23 at 18:32 | comment | added | D.W.♦ | cs.stackexchange.com/q/121660/755 | |
| Jan 14, 2018 at 17:15 | vote | accept | Eden Hassard | ||
| Jan 14, 2018 at 15:23 | answer | added | Yuval Filmus | timeline score: 8 | |
| Jan 14, 2018 at 15:09 | history | asked | Eden Hassard | CC BY-SA 3.0 |