Random backtracking in backtrack search algorithms for satisfiability (Q2643305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4473048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsystematic search and no-good learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank

Revision as of 13:09, 26 June 2024

scientific article
Language Label Description Also known as
English
Random backtracking in backtrack search algorithms for satisfiability
scientific article

    Statements

    Random backtracking in backtrack search algorithms for satisfiability (English)
    0 references
    0 references
    0 references
    23 August 2007
    0 references
    propositional satisfiability
    0 references
    backtrack search algorithms
    0 references
    randomization
    0 references
    0 references
    0 references

    Identifiers