Timeline for If a CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2017 at 17:16 | vote | accept | csTheoryBeginner | ||
| Nov 19, 2017 at 17:16 | comment | added | Yuval Filmus | Yes, that's the conclusion. | |
| Nov 19, 2017 at 17:15 | comment | added | csTheoryBeginner | So I guess it should be NP complete. | |
| Nov 19, 2017 at 17:09 | history | undeleted | Yuval Filmus | ||
| Nov 19, 2017 at 16:52 | history | deleted | Yuval Filmus | via Vote | |
| Nov 19, 2017 at 16:52 | history | answered | Yuval Filmus | CC BY-SA 3.0 |