An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/978-3-319-53925-6_28 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2588004537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum propositional proof length is NP-hard to linearly approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / 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: Narrow Proofs May Be Maximally Long / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for propositional model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive linear time algorithms for branchwidth / rank
 
Normal rank

Latest revision as of 19:13, 13 July 2024

scientific article
Language Label Description Also known as
English
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances
scientific article

    Statements

    An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (English)
    0 references
    0 references
    5 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    satisfiability
    0 references
    parameterized complexity
    0 references
    resolution size
    0 references
    incidence graph
    0 references
    pathwidth
    0 references
    0 references