A Time Leap Challenge for SAT Solving
Not on the map. Why?
Abstract (arXiv)
We compare the impact of hardware advancement and algorithm advancement for SAT solving over the last two decades. In particular, we compare 20-year-old SAT-solvers on new computer hardware with modern SAT-solvers on 20-year-old hardware. Our findings show that the progress on the algorithmic side has at least as much impact as the progress on the hardware side.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 1.
6 papers.
- 2024Algorithmic progress in language modelscited by 31
- 2022Algorithmic progress in computer visioncited by 13
- 2021Measuring Progress in Deep Reinforcement Learning Sample Efficiencycited by 8
- 2022Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?cited by 8
- 2021Design of quantum optical experiments with logic artificial intelligencecited by 1
- 2023Solving MaxSAT with Matrix Multiplicationcited by 1
- 2024Algorithmic progress in language models9 Mar 2024
- 2023Solving MaxSAT with Matrix Multiplication1 Nov 2023
- 2022Algorithmic progress in computer vision10 Dec 2022
- 2022Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?7 Oct 2022
- 2021Design of quantum optical experiments with logic artificial intelligence27 Sep 2021
- 2021Measuring Progress in Deep Reinforcement Learning Sample Efficiency9 Feb 2021