<div class="csl-bib-body">
<div class="csl-entry">Fichte, J. K., Le Berre, D., Hecher, M., & Szeider, S. (2023). The silent (r)evolution of SAT. <i>Communications of the ACM</i>, <i>66</i>(6), 64–72. https://doi.org/10.1145/3560469</div>
</div>
-
dc.identifier.issn
0001-0782
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/190276
-
dc.description.abstract
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
en
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.publisher
ASSOC COMPUTING MACHINERY
-
dc.relation.ispartof
Communications of the ACM
-
dc.rights.uri
http://creativecommons.org/licenses/by-nc-nd/4.0/
-
dc.subject
Propositional Satisfiability
en
dc.subject
Optimization
en
dc.subject
Constraint Programming
en
dc.title
The silent (r)evolution of SAT
en
dc.type
Article
en
dc.type
Artikel
de
dc.rights.license
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
en
dc.rights.license
Creative Commons Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International