10 ms·
Add to this that propositional logic (the language in which we express SAT) is a versatile language to code problems in. Finding cliques in a graph is also NP c
by butokai 2y ago
Add to this that propositional logic (the language in which we express SAT) is a versatile language to code problems in. Finding cliques in a graph is also NP complete, but it is less natural to use it as a language to code other problems.
- riku_iki 2y ago> Add to this that propositional logic (the language in which we express SAT) is a versatile language to code problems in is it though? You can't express some basic loop in propositional logic, right?
- viraptor 2y agoLoops are part of a coded solution, not the problem. With SAT you encode the problem / solution space itself.