News for hackers. Stuff that matters.

A comment on Solving SAT via Positive Supercompilation. Parent comment

Re:Solving SAT via Positive Supercompilation by Hirrolot on Thursday February 01, 2024 @03:06PM (#39220641)
The solution has exponential time and space complexity, which I noted in the blog post. It is only interesting for its simplicity and as a stress test for supercompilers.
[ Parent | on HN ]
Re:Solving SAT via Positive Supercompilation by zellyn on Thursday February 01, 2024 @03:29PM (#39220987)
Ah, I missed that. Makes perfect sense! By the way, if you're interested in the "this problem can blow up badly because it can be converted to 3-SAT", you might like https://research.swtch.com/version-sat
[ Parent | on HN ]