Satisfiability thresholds for regular occupation problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6492538 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1033851 (Why is no real title available?)
- scientific article; zbMATH DE number 1952026 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 944215 (Why is no real title available?)
- A Remark on Stirling's Formula
- A new look at survey propagation and its generalizations
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Bicolouring random hypergraphs
- Charting the replica symmetric phase
- Circular coloring of random graphs: statistical physics investigation
- Community detection and stochastic block models: recent developments
- Constraint satisfaction: random regular k-SAT
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- Hitting times for Shamir's problem
- Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
- Information, Physics, and Computation
- Information-theoretic thresholds from the cavity method
- Maximum independent sets on random regular graphs
- On the chromatic number of random \(d\)-regular graphs
- On the existence of a factor of degree one of a connected random graph
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Phase transitions in the \(q\)-coloring of random hypergraphs
- Planting colourings silently
- Proof of the satisfiability conjecture for large k
- Quasi-Eulerian hypergraphs
- Quiet planting in the locked constraint satisfaction problems
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Relations between average case complexity and approximation complexity
- Satisfiability threshold for random regular \textsc{nae-sat}
- Satisfiability thresholds for regular occupation problems
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- Survey propagation: An algorithm for satisfiability
- The asymptotic k-SAT threshold
- The phase transition in exact cover
- The phase transition in random regular exact cover
This page was built for publication: Satisfiability thresholds for regular occupation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879473)
