Solving \#SAT using vertex covers (Q2464035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-007-0056-x / 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: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / 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: Upper bounds to the clique width of graphs / 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: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Propositional Model Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets for DLL subsolvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00236-007-0056-X / rank
 
Normal rank

Latest revision as of 19:11, 18 December 2024

scientific article
Language Label Description Also known as
English
Solving \#SAT using vertex covers
scientific article

    Statements

    Solving \#SAT using vertex covers (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2007
    0 references
    obstruction graph
    0 references

    Identifiers