Correlation-based decimation in constraint satisfaction problems

No abstract is available for this paper.

• Publication year

  2010

• Venue

  arXiv: Disordered Systems and Neural Networks

• Publication date

  2010-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1088/1742-6596/233/1/012003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Artificial Intelligence in Medicine: 23rd International Conference, AIME 2025, Pavia, Italy, June 23–26, 2025, Proceedings, Part I

  2025cited by this paper
• IEICE Transactions on Information and Systems

  2012cited by this paper
• On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms

  2009cited by this paper
• Information, Physics, and Computation

  2009cited by this paper
• Statistical Physics of Hard Optimization Problems

  2008cited by this paper
• Locked constraint satisfaction problems.

  2008cited by this paper
• Constraint satisfaction problems and neural networks: A statistical physics perspective.

  2008cited by this paper
• Constraint satisfaction problems with isolated solutions are hard

  2008cited by this paper
• Phase Transitions in the Coloring of Random Graphs

  2007cited by this paper
• Géométrie et inférence dans l'optimisation et en théorie de l'information

  2007cited by this paper
• Loop Calculus in Statistical Physics and Information Science

  2006cited by this paper
• Gibbs states and the set of solutions of random constraint satisfaction problems

  2006cited by this paper
• Learning by message-passing in networks of discrete synapses

  2005cited by this paper
• Clustering of solutions in the random satisfiability problem

  2005cited by this paper
• How to compute loop corrections to the Bethe approximation

  2005cited by this paper
• Survey-propagation decimation through distributed local computations

  2005cited by this paper
• Linear Response Algorithms for Approximate Inference in Graphical Models

  2004cited by this paper
• Understanding belief propagation and its generalizations

  2003cited by this paper
• Two Solutions to Diluted p-Spin Models and XORSAT Problems

  2003cited by this paper
• Random K-satisfiability problem: from an analytic solution to an efficient algorithm.

  2002cited by this paper
• Coloring random graphs

  2002cited by this paper
• Rigorous decimation-based construction of ground pure states for spin-glass models on random lattices.

  2002cited by this paper
• Analytic and Algorithmic Solution of Random Satisfiability Problems

  2002cited by this paper
• Factor graphs and the sum-product algorithm

  2001cited by this paper
• THE EUROPEAN PHYSICAL JOURNAL B c○ EDP Sciences

  2000cited by this paper
• Sharp thresholds of graph properties, and the -sat problem

  1999cited by this paper
• Satisfiability Threshold for Random XOR-CNF Formulas

  1999cited by this paper
• IEEE TRANSACTIONS ON INFORMATION THEORY

  1998cited by this paper
• Generating Hard Satisfiability Problems

  1996cited by this paper
• Critical Behavior in the Satisfiability of Random Boolean Expressions

  1994cited by this paper
• Discrete Applied Mathematics

  1993cited by this paper
• Physics and Computation

  1987cited by this paper
• Information Theory

  1966cited by this paper
• Statistical Theory of Superlattices

  1935cited by this paper

• Mechanisms of dimensionality reduction and decorrelation in deep neural networks

  2018cites this paper
• Spatio-temporal spike train analysis for large scale networks using the maximum entropy principle and Monte Carlo method

  2012cites this paper
• Beyond Inverse Ising Model: Structure of the Analytical Solution

  2012cites this paper
• Decimation algorithm based on correlations for constraint satisfaction problems on random networks

  2009cites this paper