Timeline for Give an NL-algorithm for complement of 2-SAT
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2019 at 2:12 | vote | accept | user2668676 | ||
| May 27, 2019 at 15:26 | comment | added | user2668676 | Hi David. Thank you for the answers. About question 1, If that is the case then for CNF for 2SAT where you have literal and the negation of the literal in the same Clause or graph connection? I research about that's the case where you can define that 2SAT his unreachable or don't have a satisfiable answer. About question 2, thank for clarify the concept for me. | |
| May 27, 2019 at 11:35 | history | answered | David Richerby | CC BY-SA 4.0 |