On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous results for random (\(2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: A more accurate picture / 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: Random constraint satisfaction: Flaws and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / 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: Q4240602 / 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: Q4887479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study of phase transitions in binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Average Time Analysis of Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating the phase transition in binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting the deep structure of constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SAT phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An average analysis of backtracking on random constraint satisfaction problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:19, 6 June 2024

scientific article
Language Label Description Also known as
English
On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
scientific article

    Statements

    On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (English)
    0 references
    0 references
    0 references
    26 January 2004
    0 references
    0 references
    Phase transition
    0 references
    Constraint satisfaction
    0 references
    SAT
    0 references
    Similarity degree
    0 references