A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q37415389, #quickstatements; #temporary_batch_1714653054045
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation: An algorithm for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an analytic framework for analysing the computation time of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling genetic algorithms with Markov chains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Stochastic Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Davis-Putnam method / rank
 
Normal rank

Revision as of 22:58, 1 July 2024

scientific article
Language Label Description Also known as
English
A comparative runtime analysis of heuristic algorithms for satisfiability problems
scientific article

    Statements

    A comparative runtime analysis of heuristic algorithms for satisfiability problems (English)
    0 references
    0 references
    0 references
    0 references
    31 August 2009
    0 references
    Boolean satisfiability
    0 references
    heuristic algorithms
    0 references
    random walk
    0 references
    (1+1) EA
    0 references
    hybrid algorithm
    0 references
    expected first hitting time
    0 references
    runtime analysis
    0 references

    Identifiers