Two solutions to diluted \(p\)-spin models and XORSAT problems
From MaRDI portal
Publication:1870233
DOI10.1023/A:1022886412117zbMath1049.82073OpenAlexW1533562602MaRDI QIDQ1870233
Marc Mézard, Riccardo Zecchina, Federico Ricci-Tersenghi
Publication date: 11 May 2003
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022886412117
Related Items
On the sufficiency of pairwise interactions in maximum entropy models of networks, The solution space structure of planted constraint satisfaction problems with growing domains, Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP, Proof of the satisfiability conjecture for large \(k\), On the Structure of Solution-Graphs for Boolean Formulas, On the thresholds in linear and nonlinear Boolean equations, Combinatorics. Abstracts from the workshop held January 1--7, 2023, A local algorithm and its percolation analysis of bipartite z-matching problem, Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space, Random 2 XORSAT phase transition, On the dynamics of the glass transition on Bethe lattices, The Satisfiability Threshold fork-XORSAT, Threshold saturation in spatially coupled constraint satisfaction problems, Two faces of greedy leaf removal procedure on graphs, Random subcubes as a toy model for constraint satisfaction problems, Properties of sparse random matrices over finite fields, DRIVEN TRANSITIONS AT THE ONSET OF ERGODICITY BREAKING IN GAUGE-INVARIANT COMPLEX NETWORKS, Boolean constraint satisfaction problems for reaction networks, Calculation of the 1RSB transition temperature of spin glass models on regular random graphs under the replica symmetric ansatz, Research on solution space of bipartite graph vertex-cover by maximum matchings, Typical performance of approximation algorithms for NP-hard problems, The large deviations of the whitening process in random constraint satisfaction problems, Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics, Core influence mechanism on vertex-cover problem through leaf-removal-core breaking, Charting the replica symmetric phase, On the freezing of variables in random constraint satisfaction problems, Finite size scaling for the core of large random hypergraphs, Pairs of SAT-assignments in random Boolean formulæ, The satisfiability threshold for random linear equations, Bounds for diluted mean-fields spin glass models, The Stripping Process Can be Slow: Part II, CRITICALITY AND HETEROGENEITY IN THE SOLUTION SPACE OF RANDOM CONSTRAINT SATISFACTION PROBLEMS, Satisfiability threshold for random regular \textsc{nae-sat}, Random 2-XORSAT at the Satisfiability Threshold, On the survey-propagation equations in random constraint satisfiability problems, The theoretical capacity of the Parity Source Coder, Random multi-index matching problems, Geometrical organization of solutions to random linear Boolean equations, The set of solutions of random XORSAT formulae, Statistical and algebraic analysis of a family of random Boolean equations, Directed Dominating Set Problem Studied by Cavity Method: Warning Propagation and Population Dynamics, Pruning processes and a new characterization of convex geometries, The solution space geometry of random linear equations, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, The number of matchings in random graphs, A simple one dimensional glassy Kac model, Gallager error-correcting codes for binary asymmetric channels, Unnamed Item, Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
