Using decomposition-parameters for QBF: mind the prefix! (Q2304627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2998965526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width for first order formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width QBF is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Dependency Schemes in Search-Based QBF Solvers / 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: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Resolution Proofs for QBF using Dependency Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition algorithms for orders of small width and graphs of small Dilworth number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Dependencies and Q-Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier reordering for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite antichain of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / 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 Polynomial Time Algorithm for Bounded Directed Pathwidth / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:51, 22 July 2024

scientific article
Language Label Description Also known as
English
Using decomposition-parameters for QBF: mind the prefix!
scientific article

    Statements

    Using decomposition-parameters for QBF: mind the prefix! (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2020
    0 references
    quantified Boolean formulas
    0 references
    dependency schemes
    0 references
    treewidth
    0 references
    pathwidth
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers