Timeline for Proving 2P2N SAT is NP-Complete
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2014 at 2:24 | vote | accept | Alex Chumbley | ||
| Feb 22, 2014 at 19:36 | history | tweeted | twitter.com/#!/StackCompSci/status/437310015234641921 | ||
| Feb 21, 2014 at 20:38 | answer | added | misberner | timeline score: 3 | |
| Feb 21, 2014 at 11:52 | history | edited | Raphael |
edited tags
|
|
| Feb 21, 2014 at 5:21 | answer | added | Alex Chumbley | timeline score: 0 | |
| Feb 21, 2014 at 5:17 | comment | added | Yuval Filmus | Perhaps you could answer your own question, for the record? | |
| Feb 21, 2014 at 4:58 | comment | added | Alex Chumbley | @YuvalFilmus, good call, that worked out great! | |
| Feb 21, 2014 at 3:36 | comment | added | Yuval Filmus | In this case you should probably reduce 3SAT to 2P2N-SAT to show that the latter is NP-hard. | |
| Feb 21, 2014 at 3:32 | comment | added | Yuval Filmus | What do you mean by "I am trying to prove it is Satisfiable"? When is a language Satisfiable? | |
| Feb 21, 2014 at 2:34 | history | asked | Alex Chumbley | CC BY-SA 3.0 |