Are hitting formulas hard for resolution? (Q6162037): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4377137653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New width parameters for SAT and \#SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of read-once resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of some classes of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Green-Tao Numbers and SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Davis-Putnam reductions for minimally unsatisfiable clause-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \#SAT using vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of acyclic and almost acyclic CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Hardest Formulas for Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of clause-learning SAT solvers as resolution engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximate reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3434502 / rank
 
Normal rank

Latest revision as of 08:42, 1 August 2024

scientific article; zbMATH DE number 7696121
Language Label Description Also known as
English
Are hitting formulas hard for resolution?
scientific article; zbMATH DE number 7696121

    Statements

    Are hitting formulas hard for resolution? (English)
    0 references
    0 references
    0 references
    15 June 2023
    0 references
    hitting formulas
    0 references
    resolution
    0 references
    satisfiability
    0 references
    SAT
    0 references
    symmetry breaking
    0 references

    Identifiers

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