Complete on average Boolean satisfiability (Q1872642): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the theory of average case complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomizing Reductions of Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375756 / 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: Probabilistic performance of a heurisic for the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional Word Problem for Groups / rank
 
Normal rank

Latest revision as of 16:24, 5 June 2024

scientific article
Language Label Description Also known as
English
Complete on average Boolean satisfiability
scientific article

    Statements

    Complete on average Boolean satisfiability (English)
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    average NP-completeness
    0 references
    distributional tiling
    0 references
    distributional Boolean
    0 references
    satisfiability
    0 references
    randomized reductions.
    0 references
    dynamic binary coding scheme
    0 references
    CNF formulas
    0 references
    0 references