Hacker Blog Posts

Hirrolot personal blog

Solving SAT via Positive Supercompilation

by hirrolot hirrolot.github.io

The boolean satisfiability problem (“SAT” for short) is arguably the most famous NP-complete problem in theoretical computer science. According to Wikipedia, it is “the problem of determining if there exists an interpretation that satisfies a given Boolean formula ”; or, in simpler terms, if there is at least one…
Read on hirrolot.github.io → Discuss on HN (38) Archived copy
Points
153
HN comments
38
Submissions
1
Cited by
0 commenters

Software EngineeringMath & Algorithms2024

On Hacker News

SubmittedTitle on HNPointsComments
Feb 1, 2024Solving SAT via Positive Supercompilation by Hirrolot15338

More from Hirrolot

All 6 posts →

Related posts from the same era