The number of satisfying assignments of random 2‐SAT formulas (Q6074640): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the concentration of the number of solutions of random satisfiability formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiability threshold for random linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monge-Kantorovich problem: achievements, connections, and perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length of prime implicants and number of solutions of random CNF formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The replica symmetric phase of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic thresholds from the cavity method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic \(k\)-SAT threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT with prescribed literal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random MAX SAT, random MAX CUT, and their phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ising models on locally tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor models on locally tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Thresholds for Cuckoo Hashing via XORSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability threshold for random regular \textsc{nae-sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Satisfiability Conjecture for Large k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-XORSAT threshold. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT: Results and problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replica bounds for optimization problems and diluted spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broken replica symmetry bounds in the mean field spin glass model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs states and the set of solutions of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component behavior near the critical point of the random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of the<i>K</i>-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spin glass models from the point of view of spin distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the replica symmetric solution of the \(K\)-sat model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for diluted mean-fields spin glass models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Satisfiability Threshold for<i>k</i>-XORSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Solutions in Random Graph<i>k</i>-Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The high temperature case for the random \(K\)-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Revision as of 04:11, 3 August 2024

scientific article; zbMATH DE number 7749469
Language Label Description Also known as
English
The number of satisfying assignments of random 2‐SAT formulas
scientific article; zbMATH DE number 7749469

    Statements

    The number of satisfying assignments of random 2‐SAT formulas (English)
    0 references
    12 October 2023
    0 references
    2-SAT
    0 references
    belief propagation
    0 references
    satisfiability problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references