Generating hard satisfiability problems (Q2674174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56039657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outlier..........s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / 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 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 analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems are sometimes hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / 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: Some pitfalls for experimenters with random SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3985347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical behavior in the computational cost of satisfiability testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the satisfiability problem by using randomized approach / rank
 
Normal rank

Latest revision as of 04:18, 30 July 2024

scientific article
Language Label Description Also known as
English
Generating hard satisfiability problems
scientific article

    Statements

    Generating hard satisfiability problems (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2022
    0 references
    satisfiability
    0 references
    random problems
    0 references
    phase transitions
    0 references
    empirical study
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references