The Silent (R)evolution of SAT
The propositional satisfiability problem (SAT) was the first problem to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness. However, in stark contrast to its theoretical hardness, the SAT problem has emerged as an essential tool for efficiently sol...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
ACM|Communications of the ACM
2023
|
| Online Access: | https://hdl.handle.net/1721.1/150840 |