How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56475807, #quickstatements; #temporary_batch_1711626644914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Unsatisfiable <i>k</i>-CNF Formulas with Few Occurrences per Variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lovász local lemma in the space of random injections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309031 / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
How Many Conflicts Does It Need to Be Unsatisfiable?
scientific article

    Statements

    How Many Conflicts Does It Need to Be Unsatisfiable? (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    satisfiability
    0 references
    unsatisfiable formulas
    0 references
    conflict graph
    0 references
    Lovász Local Lemma
    0 references
    0 references
    0 references