4 ms·
No the assumption is that a logic system cannot be complex… well 2-SAT likes to have a word with the author I guess
by hnaccount_rng 5y ago
No the assumption is that a logic system cannot be complex… well 2-SAT likes to have a word with the author I guess
- abetusk 5y agoI'm not sure if it was intentional or not but 2-SAT is polynomial solvable [0] whereas 3-SAT is NP-Complete [1]. [0] https://en.wikipedia.org/wiki/2-satisfiability#Algorithms https://en.wikipedia.org/wiki/2-satisfiability#Algorithms [1] https://en.wikipedia.org/wiki/Boolean_satisfiability_problem#3-satisfiability https://en.wikipedia.org/wiki/Boolean_satisfiability_problem...
- 9wzYQbTYsAIc 5y agoIndeed, that does appear to be another of the many assumptions made in the article.