scientific article; zbMATH DE number 2046061

zbMATH Open1073.68654arXivmath/0210470MaRDI QIDQ4451041FDOQ4451041

David Gamarnik

Publication date: 22 February 2004

Full work available at URL: https://arxiv.org/abs/math/0210470

Title of this publication is not available (Why is that?)

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)

Cited In (4)

• Title not available (Why is that?)
• Phase transitions in semidefinite relaxations
• Title not available (Why is that?)
• On the phase transitions of random \(k\)-constraint satisfaction problems

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎

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)