A Better Algorithm for Random k-SAT

DOI10.1007/978-3-642-02927-1_25zbMath1248.68452OpenAlexW2067182344MaRDI QIDQ3638042

Amin Coja-Oghlan

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Cryptographic hardness of random local functions. Survey ⋮ Proof of the satisfiability conjecture for large \(k\) ⋮ Decoding from Pooled Data: Sharp Information-Theoretic Bounds

This page was built for publication: A Better Algorithm for Random k-SAT