The Silent (R)evolution of SAT
By Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider Communications of the ACM, June 2023, Vol. 66 No. 6, Pages 64-72 10.1145/3560469 Comments Credit: Igor Kisselev The propositional satisfiability problem (SAT) was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness. However, in stark…
CYBE 🌍 