Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363): 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: On the complexity of approximating the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Witnesses for Unsatisfiable 2CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding short resolution refutations and small unsatisfiable subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding read-once resolution refutations in systems of 2CNF clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted cutting plane proofs in Horn constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-once resolutions in Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / 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: What is answer set programming to propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539605 / rank
 
Normal rank

Revision as of 00:02, 28 July 2024

scientific article
Language Label Description Also known as
English
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
scientific article

    Statements

    Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (English)
    0 references
    14 February 2022
    0 references
    2CNF
    0 references
    read-once resolution
    0 references
    NP-hard
    0 references
    exact exponential algorithms
    0 references

    Identifiers