PPSZ for k ≥ 5: More Is Better

DOI10.1145/3349613zbMath1496.68259OpenAlexW2972401921MaRDI QIDQ5205821

Dominik Scheder

Publication date: 16 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

Boolean satisfiabilityrandomized algorithmsexponential algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Super strong ETH is true for PPSZ with small resolution width

This page was built for publication: PPSZ for k ≥ 5: More Is Better