Linear phase transition in random linear constraint satisfaction problems

DOI10.1007/S00440-004-0345-ZMaRDI QIDQ1881641zbMATH OpenOpenAlexFDO

Authors David Gamarnik

Publication date 5 October 2004

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01183947/file/dmAC0111.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Stochastic programming (90C15) Combinatorial probability (60C05)

Cited in

(8)

• scientific article; zbMATH DE number 6469137 (Why is no real title available?)
• Phase transitions in semidefinite relaxations
• Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
• Invariant probability measures and dynamics of exponential linear type maps
• Right-convergence of sparse random graphs
• On the phase transitions of random \(k\)-constraint satisfaction problems
• Weighted enumeration of spanning subgraphs in locally tree-like graphs
• The planted matching problem: phase transitions and exact results

This page was built for publication: Linear phase transition in random linear constraint satisfaction problems

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