Back
Daniel Le Berre (Artois University), Johannes K. Fichte (Linköping University), Markus Hecher (Massachusetts Institute of Technology), Stefan Szeider (TU Wien)
Author/s
About the resource/s
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 contrast to its theoretical hardness, SAT has emerged as a central target problem for efficiently solving a wide variety of computational problems. SAT solving technology has continuously advanced since a breakthrough around the millennium, which catapulted practical SAT solving ahead by orders of magnitudes. Today, the many flavours of SAT technology can be found in all areas of technological innovation.
Other Sources
