Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Statistical physics of hard optimization problems

Statistical physics of hard optimization problems http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Physica Slovaca de Gruyter

Statistical physics of hard optimization problems

Zdeborová, Lenka
Acta Physica Slovaca , Volume 59 (3): 135 – Jun 1, 2009
Download PDF
135 pages

Loading next page...
 
/lp/de-gruyter/statistical-physics-of-hard-optimization-problems-X6z38HYuX5

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © by Walter de Gruyter GmbH
ISSN
1336-040X
eISSN
1336-040X
DOI
10.2478/v10155-010-0096-6
Publisher site
See Article on Publisher Site

Abstract

Journal

Acta Physica Slovaca – de Gruyter

Published: Jun 1, 2009

References

  • Random free energies in spin - glasses Physique
    Mézard
  • The capacity of low - density parity - check codes under message - passing decoding Inform Theory
    Richardson
  • Graph optimisation problems nad the potts glass A
    Kanter
  • Replicas optimization Physique
    Mézard
  • Exhaustive enumeration unveils clustering and freezing in random sat
    John Ardelius
  • MS From large scale rearrangements to mode coupling phenomenology
    Montanari
  • The two - parameter poisson - dirichlet distribution derived from a stable subordinator
    Pitman
  • Par a Magnetic properties of spin - glasses in a new mean - field theory
    Parisi
  • Survey propagation revisited of rd pages Virginia
    Lukas Kroc
  • a Marc Andrea Reconstruction on trees and spin glass transition september
    Mézard
  • Par a On local equilibrium equations for clustering states arXiv cs
    Parisi
  • Henry and Local search strategies for satisfiability testing In Trick editors Proceedings of the Second DIMACS Challange on Cliques Coloring and Providence
    Bart Selman
  • Factor graphs and the sum product algorithm Inform Theory
    Kschischang
  • Noise strategies for improving local search th pages CA
    Bart Selman
  • ER On random graphs
    Erdős
  • Clustering of solutions in the random satisfiability problem
    Mézard
  • Marc Threshold values of random k sat from the cavity method Random
    Stephan Mertens
  • Gal theory reliable communication New York
    Gallager
  • Statistical Mechanics of Disordered Systems Mathematical Perspective University
    Anton Bovier
  • Erik Behavior of heuristics on large and hard satisfiability problems
    John Ardelius
  • Structural glass transition and the entropy of the metastable states
    Monasson
  • procedure for quantification theory of the
    Martin Davis
  • Analytical solution of the off - equilibrium dynamics of a long - range spin glass model
    Cugliandolo
  • Pea Reverend bayes on inference engines distributed hierarchical approach InProceedings American Association of Artificial Intelligence National Conference on pages Pittsburgh PA
    Pearl
  • Counting without sampling : new algorithms for enumeration problems using statistical physics of the th SIAM Symposium on Discrete Algorithms pages New York
    Antar Bandyopadhyay
  • Limit theorems for decomposable multi - dimensional galton - watson processes
    Kesten
  • constraint satisfaction problems
    Zdeborová
  • Formation of glasses from liquids and
    Ang
  • vMS Random graph coloring physics approach
    van Mourik
  • Learning by Message Passing in Networks of Discrete Synapses
    Braunstein
  • Threshold values stability analysis and high - qasymptotics for the coloring problem on random graphs
    Krzakala
  • landscape analysis of constraint satisfaction problems
    Krzakala
  • The chromatic number of random graphs
    Luc
  • Phase coexistence and finite - size scaling in random combinatorial problems
    LRTZ
  • Solvable model of a spin - glass
    Sherrington
  • BMP Polynomial iterative algorithms for coloring and analyzing random graphs
    Braunstein
  • Statistical mechanics of the randomk - satisfiability model Aug
    Rémi Monasson
  • The glassy phase of codes
    Montanari
  • Maximum weight matching via max - product belief propagation Theory
    Bayati
  • Average time analysis of simplified davisputnam procedure Process see also Errata
    Goldberg
  • Bob and Where the Really Hard Problems Are th pages San CA
    Peter Cheeseman
  • Phase transition in the number partitioning problem Nov
    Stephan Mertens
  • Andrea Cooling - schedule dependence of the dynamics of mean - field glasses
    Montanari
  • - Out of equilibrium dynamics in spin glasses and other glassy systems In Young editor Glasses and Random Fields World Scientific Singapore
    BCKM
  • of solutions in constraint satisfaction problems
    Mézard
  • Par On the survey - propagation equations for the random k - satisfiability problem arXiv cs
    Parisi
  • DLL machine program for theorem - proving
    Martin Davis
  • Géométrie inférence dans optimisation en théorie de information thesis Paris Sud http tel archives ouvertes fr tel en
    Mora
  • Toulouse Replica symmetry breaking and the nature of the spin - glass phase Physique
    Mézard
  • Silvio Giorgio Phase diagram of coupled glassy systems mean - field study
    Franz
  • KT spin - interaction spin - glass models : Connections with the structural glass problem
    Kirkpatrick
  • Frozen glass phase in the multi - index matching problem
    Martin
  • a Mean - field equations for the matching and the travelling salesman problem
    Mézard
  • Par sequence of approximated solutions to the SK model for spin - glasses
    Parisi
  • Phases vitreuses optimisation grandes déviations PhD thesis Paris Sud http tel archives ouvertes fr tel en
    Olivier Rivoire
  • Coo The complexity of theorem - proving procedures rd pages New York
    Stephen
  • Tal The formula
    Talagrand
  • liquids and the glass transition
    Debenedetti
  • Jan Stability of solutions of the sherrington - kirkpatrick model with respect to replications of the phase space
    Janiš
  • states and the set of solutions of random constraint satisfaction problems
    KMRT
  • Rigorous location of phase transitions in hard optimization problems
    Achlioptas
  • The bethe lattice spin glass revisited
    Mézard
  • Gal Low - density parity check codes Inform Theory
    Robert
  • a Additional limit theorems for indecomposable multidimensional galton - watson processes The of
    Kesten
  • KZ glass on random graphs
    Florent Krzakala
  • Der Derrida Random model Limit of a family of disordered models
  • KGV Optimization by simulated annealing
    Kirkpatrick
  • hike in the phases of the in satisfiability School on
    Maneva
  • FA Application of statistical mechanics to NP complete problems in combinatorial optimization
    Fu
  • ZK Phase transitions in the coloring of random graphs
    Zdeborová
  • Mean - field theory of the potts glass Jul
    Gross
  • Theory of spin - glasses
    Edwards
  • among combinatorial problems In editors of Computations pages Plenum New York
    Karp
  • MS a On the number of circuits in random graphs of and
    Marinari
  • Reconstruction for models on random graphs of th pages
    Gerschenfeld
  • KT a Dynamics of the structural glass transition and thep - spin - interaction spin - glass model
    Kirkpatrick
  • Survey - propagation decimation through distributed local computations page
    CFMZ
  • Pap complexity
    Papadimitriou
  • Equation of State Calculations by Fast Machines The of
    Metropolis
  • ART On the solution - space geometry of random constraint satisfaction problems of th pages New York
    Dimitris Achlioptas
  • rigorous proof of the cavity method for counting matchings arXiv cond mat cond mat dis nn
    Mohsen Bayati
  • Kau The nature of the glassy state and the behavior of liquids at low temperatures
    Kauzmann
  • glass models with ferromagnetically biased couplings on the bethe lattice : analytic solution and numerical simulations
    CKRT
  • Silvio Michele Exact solutions for diluted spin glasses and optimization problems Aug
    FLRTZ
  • Phase diagrams for dilute spin - glasses
    Viana
  • EFF http eff org awards coop prime rules php
  • Der Derrida Random model An exactly solvable model of disordered systems
  • Glasses volume ofCambridge Studies in Magnetism University
    Fischer
  • Random multi - index matching problems
    Martin
  • Sin for Random Generation and Counting Markov Chain Approach
    Sinclair
  • dAT de Stability of the Sherrington solution of a spin - glass model
    Almeida
  • satisfiability problem : From an analytic solution to an efficient algorithm
    Mézard
  • new method for solving hard satisfiability problems In editors Proceedings of the Tenth National Conference on Artificial pages California
    Bart Selman
  • Danny Rigorous results for random
    AKKK
  • new look at survey propagation and its generalizations
    Elitza
  • The number of matchings in random graphs of and
    Zdeborová
  • a Decimation strategies beliefs local information in preparation
    Lukas Kroc
  • KW Vladimir On the optimality of tree - reweighted max - product message passing st Conference on Uncertainty in Artificial
    Kolmogorov
  • MS Rigorous inequalities between length and time scales in glassy systems
    Montanari
  • Gar glasses with spin interactions
    Gardner
  • AH Haken Every planar map is four colorable part i discharging Illinois
    Appel
  • MS On the dynamics of the glass transition on bethe lattices
    Montanari
  • Survey propagation An algorithm for satisfiability Random
    Braunstein
  • NS Multiple states and thermodynamic limits in short - ranged ising spin - glass models Jul
    Newman
  • a sat Relation of typical - case complexity to the nature of the phase transition Random Structures and
    Monasson
  • Good codes based on very sparse matrices InProceedings of the th IMA Conference on Cryptography and pages Verlag
    David
  • Relaxation and metastability in a local search procedure for the random satisfiability problem
    Guilhem Semerjian
  • of the Heidelberg Colloquium on spin glasses in
    Pal
  • Geo Measures Phase Gruyter
    Georgii
  • simpler max - product maximum weight matching algorithm and the auction algorithm Theory
    Bayati
  • of the satisfiability problem
    Monasson
  • thresholds of graph proprties thek problem
    Friedgut
  • Recipes for Metastable States in Spin Glasses de November
    Franz
  • Reconstruction on trees Beating the second eigenvalue
    Elchanan Mossel
  • SAO Focused local search for random satisfiability page
    Sakari Seitz
  • The Phase Diagram of in Problem
    Raymond
  • Pea Probabilistic reasoning in intelligent systems : networks of plausible inference Publishers San CA
    Judea Pearl
  • CA Experimental results on the crossover point in random sat
    James
  • On the complexity of the satisfiability problem Report volume New York
    Goldberg
  • Pap On selecting a satisfying truth assignment ( extended abstract InProceedings of the nd symposium on Foundations of computer pages Los CA
    Christos
  • satisfiable clause sets for benchmarking equivalnce reasoning techniques on Modeling and Computations
    HJKN
  • replica analysis of the travelling salesman problem Physique
    Mézard
  • The phase transition in in sat nae sat Proceedings of the twelfth annual ACMSIAM symposium on Discrete algorithms pages Philadelphia PA for Industrial and Mathematics
    ACIM
  • Critical behavior in the satisfiability of random boolean expression
    Kirkpatrick
  • AH a Haken Every planar map is four colorable ii reducibility Illinois
    Appel
  • Computers intractability a guide to the theory of completeness San
    Garey
  • Determining computational complexity from characteristic phase transitions
    Monasson