Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Remi Monasson / rank
Normal rank
 
Property / author
 
Property / author: Remi Monasson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142281466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for random 3-SAT via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold in proof complexity / 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: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics methods and phase transitions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results related to threshold phenomena research in satisfiability: Lower bounds / 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: Analysis of Two Simple Heuristics on a Random Instance ofk-sat / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems are sometimes hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3370783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704799 / 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: Differential equations for random processes and random graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:39, 6 June 2024

scientific article
Language Label Description Also known as
English
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
scientific article

    Statements

    Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (English)
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Satisfiability
    0 references
    Analysis of algorithms
    0 references
    Backtrack
    0 references
    0 references