Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Average Time Analysis of Backtracking / 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: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pure Literal Rule and Polynomial Average Time / rank
 
Normal rank

Revision as of 09:23, 21 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
scientific article

    Statements

    Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (English)
    0 references
    0 references
    0 references
    1990
    0 references
    unit-clause literal selection
    0 references
    satisfiability problem
    0 references
    probabilistic analysis
    0 references

    Identifiers