3 ms·
This post sketches a proof of the NP-hardness of SATisfiabiliy of boolean formula [1]. [1] https://en.wikipedia.org/wiki/Cook%E2%80%93Levin_theorem https://en
by tromp 4y ago
This post sketches a proof of the NP-hardness of SATisfiabiliy of boolean formula
[1].
[1] https://en.wikipedia.org/wiki/Cook%E2%80%93Levin_theorem https://en.wikipedia.org/wiki/Cook%E2%80%93Levin_theorem