Backdoors to q-Horn (Q261394): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-014-9958-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Velev SAT Benchmarks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-014-9958-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162347299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
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: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553262 / 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: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable and term removal from Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting truth assignments of formulas of bounded tree-width or clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for propositional model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-014-9958-5 / rank
 
Normal rank

Latest revision as of 12:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Backdoors to q-Horn
scientific article

    Statements

    Backdoors to q-Horn (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2016
    0 references
    algorithms
    0 references
    data structures
    0 references
    backdoor sets
    0 references
    satisfiability
    0 references
    fixed-parameter tractability
    0 references

    Identifiers