On the solution-space geometry of random constraint satisfaction problems
From MaRDI portal
Recommendations
- On braided T-categories over multiplier Hopf algebras.
- Yetter-Drinfeld modules over weak multiplier bialgebras
- Constructing new braided T-categories over regular multiplier Hopf algebras.
- Generalized (anti) Yetter-Drinfeld modules as components of a braided \(T\)-category.
- Endomorphism algebras in the Yetter-Drinfel'd module category over a regular multiplier Hopf algebra
Cited in
(57)- Pruning processes and a new characterization of convex geometries
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
- Convergence and correctness of belief propagation for the Chinese postman problem
- The number of solutions for random regular NAE-SAT
- Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
- The algorithmic hardness threshold for continuous random energy models
- Optimal testing for planted satisfiability problems
- On the satisfiability threshold of formulas with three literals per clause
- Minimal contagious sets in random regular graphs
- Locally computable UOWHF with linear shrinkage
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
- Pairs of SAT-assignments in random Boolean formulæ
- The asymptotics of the clustering transition for random constraint satisfaction problems
- On braided T-categories over multiplier Hopf algebras.
- Criticality and heterogeneity in the solution space of random constraint satisfaction problems
- On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas
- Reconstruction and clustering in random constraint satisfaction problems
- The large deviations of the whitening process in random constraint satisfaction problems
- Cryptographic hardness of random local functions. Survey
- On the survey-propagation equations in random constraint satisfiability problems
- Upper-bounding the k-colorability threshold by counting covers
- Bounds for random constraint satisfaction problems via spatial coupling
- Phase transitions in the \(q\)-coloring of random hypergraphs
- Models for Random Constraint Satisfaction Problems
- Branching process approach for 2-SAT thresholds
- Biased landscapes for random constraint satisfaction problems
- Disordered systems insights on computational hardness
- The solution space structure of planted constraint satisfaction problems with growing domains
- Constructing concrete hard instances of the maximum independent set problem
- Random formulas have frozen variables
- Statistical and algebraic analysis of a family of random Boolean equations
- Rigid colorings of hypergraphs and contiguity
- Endomorphism algebras in the Yetter-Drinfel'd module category over a regular multiplier Hopf algebra
- Random 2-SAT solution components and a fitness landscape
- Solution space coupling in the random \(K\)-satisfiability problem
- Spanning trees in random satisfiability problems
- The condensation transition in random hypergraph 2-coloring
- Geometric properties of satisfying assignments of random ε-1-in-kSAT
- Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion
- On the solution-space geometry of random constraint satisfaction problems
- On the Boolean connectivity problem for Horn relations
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
- Convergence and correctness of belief propagation for weighted min-max flow
- Algebraic dynamical systems from LDPC codes satisfy a strong negation of the weak Pinsker property
- Shattering in the Ising p-spin glass model
- Shattering in pure spherical spin glasses
- Estimating satisfiability
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- Yetter-Drinfeld modules over weak multiplier bialgebras
- Finding one community in a sparse graph
- Random subcubes as a toy model for constraint satisfaction problems
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
- Finite size scaling for the core of large random hypergraphs
- Why almost all k-colorable graphs are easy to color
- Solution clustering in random satisfiability
- Gibbs measures and phase transitions on sparse random graphs
This page was built for publication: On the solution-space geometry of random constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891921)
