Faster k -SAT algorithms using biased-PPSZ

DOI10.1145/3313276.3316359zbMath1433.68602OpenAlexW2952270385MaRDI QIDQ5212800

Haim Kaplan, Thomas Dueholm Hansen, Or Zamir, Uri Zwick

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3313276.3316359

zbMATH Keywords

randomized algorithmsatisfiability

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computational aspects of satisfiability (68R07)

Related Items (3)

An improved upper bound for SAT ⋮ A note on hardness of computing recursive teaching dimension ⋮ Super strong ETH is true for PPSZ with small resolution width

This page was built for publication: Faster k -SAT algorithms using biased-PPSZ