A Time Leap Challenge for SAT Solving · HackerPapers discussions

A Time Leap Challenge for SAT Solving — mentioned by bmc7505

Sat, 02 Aug 2025 00:18:06 GMT

The difference is that SAT/SMT solvers have primarily relied on single-threaded algorithmic improvements [1] and unlike neural networks, we have not [yet] discovered a uniformly effective strategy for leveraging additional computation to accelerate wall-clock runtime. [2] [1]: https://arxiv.org/pdf/2008.02215 [2]: https://news.ycombinator.com/item?id=36081350

Paper and discussion history. A mention is not an endorsement.

A Time Leap Challenge for SAT Solving — mentioned by sanxiyn

Fri, 26 May 2023 05:14:15 GMT

You may want to read "A Time Leap Challenge for SAT Solving". It's just a really fun paper: https://arxiv.org/abs/2008.02215

Paper and discussion history. A mention is not an endorsement.

A Time Leap Challenge for SAT Solving — mentioned by Isinlor

Sun, 06 Feb 2022 14:53:47 GMT

Roughly half/half, skewed more towards improvements in algorithms. Measuring the Algorithmic Efficiency of Neural Networks: https://arxiv.org/abs/2005.04305 In this work, we argue that algorithmic progress has an aspect that is both straightforward to measure and interesting: reductions over time in the compute needed to reach past capabilities. We show that the number of floating-point operations required to train a classifier to AlexNet-level performance on ImageNet has decreased by a factor of 44x between 2012 and 2019. This corresponds to algorithmic efficiency doubling every 16 months…

Paper and discussion history. A mention is not an endorsement.

A Time Leap Challenge for SAT Solving — HN submission

Mon, 21 Sep 2020 15:00:23 GMT

A Time Leap Challenge for Sat Solving

100 points; 11 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Time Leap Challenge for SAT Solving — HN submission

Sun, 13 Sep 2020 20:39:53 GMT

A Time Leap Challenge for Sat Solving

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.