A CNF Class Generalizing Exact Linear Formulas (Q3502711): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / 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: Nested satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CNF Formula Hierarchy over the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of mixed Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear CNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding solutions for extended Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
A CNF Class Generalizing Exact Linear Formulas
scientific article

    Statements

    A CNF Class Generalizing Exact Linear Formulas (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    CNF satisfiability
    0 references
    exact linear formula
    0 references
    hypergraph
    0 references
    fibre-transversal
    0 references
    0 references