Improved Randomized Algorithms for 3-SAT

DOI10.1007/978-3-642-17517-6_9zbMath1310.68230OpenAlexW1479933940MaRDI QIDQ3060723

Suguru Tamaki, Kazuhisa Seto, Tadashi Takai, Kazuo Iwama

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_9

zbMATH Keywords

randomized algorithms3-SATexponential-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (4)

MaxMinMax problem and sparse equations over finite fields ⋮ Derandomizing the HSSW algorithm for 3-SAT ⋮ On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} ⋮ Improved agreeing-gluing algorithm

This page was built for publication: Improved Randomized Algorithms for 3-SAT