Pairs of SAT-assignments in random Boolean formulæ (Q2481970): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions and the search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae / 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: Threshold values of random <i>K</i>‐SAT from the cavity method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation: An algorithm for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instability of one-step replica-symmetry-broken phase in satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two solutions to diluted \(p\)-spin models and XORSAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-XORSAT threshold. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dynamics of the glass transition on Bethe lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical organization of solutions to random linear Boolean equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial sharpness criterion and phase transition classification for random CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hunting for sharp thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in a random hypergraph / rank
 
Normal rank

Latest revision as of 20:30, 27 June 2024

scientific article
Language Label Description Also known as
English
Pairs of SAT-assignments in random Boolean formulæ
scientific article

    Statements

    Pairs of SAT-assignments in random Boolean formulæ (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    satisfiability
    0 references
    clustering
    0 references
    0 references
    0 references
    0 references

    Identifiers