The number of satisfying assignments of random 2‐SAT formulas
From MaRDI portal
Publication:6074640
Recommendations
Cites work
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1256700 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A threshold for unsatisfiability
- Bounds for diluted mean-fields spin glass models
- Broken replica symmetry bounds in the mean field spin glass model
- Combinatorics and complexity of partition functions
- Component behavior near the critical point of the random graph process
- Counting good truth assignments of random \(k\)-SAT formulae
- Entropy of theK-Satisfiability Problem
- Factor models on locally tree-like graphs
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Information, Physics, and Computation
- Ising models on locally tree-like graphs
- Length of prime implicants and number of solutions of random CNF formulae
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- On the concentration of the number of solutions of random satisfiability formulas
- On the number of solutions in random graph \(k\)-colouring
- On the replica symmetric solution of the \(K\)-sat model
- Proof of the satisfiability conjecture for large \(k\)
- Random 2-SAT with prescribed literal degrees
- Random 2-SAT: Results and problems
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Random MAX SAT, random MAX CUT, and their phase transitions
- Replica bounds for optimization problems and diluted spin systems
- Satisfiability threshold for random regular \textsc{nae-sat}
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
- Spin glass models from the point of view of spin distributions
- The 3-XORSAT threshold.
- The Complexity of Enumeration and Reliability Problems
- The Evolution of Random Graphs
- The Monge-Kantorovich problem: achievements, connections, and perspectives
- The asymptotic k-SAT threshold
- The high temperature case for the random \(K\)-sat problem
- The number of satisfying assignments of random regular \(k\)-SAT formulas
- The phase transition in 1-in-\(k\) SAT and NAE 3-SAT
- The probabilistic method
- The replica symmetric phase of random constraint satisfaction problems
- The satisfiability threshold for \(k\)-XORSAT
- The satisfiability threshold for random linear equations
- The scaling window of the 2-SAT transition
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
Cited in
(12)- Counting good truth assignments of random \(k\)-SAT formulae
- Tricritical points in random combinatorics: the -SAT case
- Exact enumeration of satisfiable 2-SAT formulae
- Random 2-SAT solution components and a fitness landscape
- On the number of 2-SAT functions
- Approximating highly satisfiable random 2-SAT
- Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
- The number of satisfying assignments of random regular \(k\)-SAT formulas
- Random 2-SAT: Results and problems
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- Counting solutions to random CNF formulas
- Belief propagation on the random \(k\)-SAT model
This page was built for publication: The number of satisfying assignments of random 2‐SAT formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074640)
