scientific article; zbMATH DE number 2046061

MaRDI QIDQ4451041zbMATH OpenFDO

Authors David Gamarnik

Publication date 22 February 2004

Full work available at URL https://arxiv.org/abs/math/0210470, http://www.emis.de/journals/DMTCS/proceedings/html/dmAC0111.abs.html

zbMATH Keywords

linear programmingsparse random graphssatisfiability thresholdrandom \(K\)-SAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 6469137
• On the phase transitions of random \(k\)-constraint satisfaction problems
• Phase transitions of random constraint satisfaction problems
• Random MAX SAT, random MAX CUT, and their phase transitions
• scientific article; zbMATH DE number 7301529

Cited in

(5)

• scientific article; zbMATH DE number 6469137 (Why is no real title available?)
• Phase transitions in semidefinite relaxations
• scientific article; zbMATH DE number 2084721 (Why is no real title available?)
• On the phase transitions of random \(k\)-constraint satisfaction problems
• Phase transitions in integer linear problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451041)