scientific article

zbMath1192.68949MaRDI QIDQ3576756

Dan Vilenchik, Michael Krivelevich, Amin Coja-Oghlan

Publication date: 2 August 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0107/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

message passing algorithmsSATalgorithms and data structurescomputational and structural complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99)

Related Items (4)

Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Why almost all \(k\)-colorable graphs are easy to color ⋮ Optimal testing for planted satisfiability problems ⋮ On Super Strong ETH

Uses Software

• Walksat

This page was built for publication: