Timeline for NP-hardness of an extention of 2 sat
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2017 at 14:48 | comment | added | Yuval Filmus | I think you should be able to complete the rest of the proof on your own without my intervention. | |
| Oct 23, 2017 at 14:47 | comment | added | NedaHn | but in this form, won't all clauses be removed????, unless just especial literals for example those which are negative of variables corresponded to the edges in the independent set be removed!! then the rest cnf will be satisfiable?? Can U tell me I concluded correctly or not | |
| Oct 23, 2017 at 14:01 | history | answered | Yuval Filmus | CC BY-SA 3.0 |