[Libre-soc-dev] Potential speed up of our mul proofs

[Cole Poirier]

On Thu, Oct 29, 2020 at 1:49 PM Cole Poirier <colepoirier at gmail.com> wrote:
>
> Perhaps this could speed up our mul proofs by an order of
> magnitude? Thoughts? I've linked it on the wiki resources page.

There's also this, the algorithms (papers) submitted for 2018
International SAT Competition
https://web.archive.org/web/20201029205239/https://helda.helsinki.fi/bitstream/handle/10138/237063/sc2018_proceedings.pdf,
and the results on their website
https://web.archive.org/web/20201029205637/http://www.satcompetition.org/.

Cole