On finding short resolution refutations and small unsatisfiable subsets (Q820148): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/FellowsSW06, #quickstatements; #temporary_batch_1731543907597
 
(5 intermediate revisions by 5 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.1016/j.tcs.2005.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171456022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / 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: Q4790380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / 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: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of database queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57359981 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/FellowsSW06 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:30, 14 November 2024

scientific article
Language Label Description Also known as
English
On finding short resolution refutations and small unsatisfiable subsets
scientific article

    Statements

    On finding short resolution refutations and small unsatisfiable subsets (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2006
    0 references
    resolution complexity
    0 references
    parameterized complexity
    0 references
    \(\text{W}[1]\)-completeness
    0 references
    bounded local treewidth
    0 references
    planar formulas
    0 references

    Identifiers