Structural tractability of counting of solutions to conjunctive queries (Q269342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-014-9543-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088101961 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.2059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree width and related hypergraph invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Acyclic Conjunctive Queries and Constant Delay Enumeration / 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: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Hypertree Width: Decomposition Methods Without Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified theory of structural tractability for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting homomorphisms seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted counting for acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural tractability of enumerating CSP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing constraint satisfaction problems using database techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating fractional hypertree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable counting of the answers to conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-014-9543-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:02, 9 December 2024

scientific article
Language Label Description Also known as
English
Structural tractability of counting of solutions to conjunctive queries
scientific article

    Statements

    Structural tractability of counting of solutions to conjunctive queries (English)
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    conjunctive queries
    0 references
    counting complexity
    0 references
    hypergraph decomposition techniques
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references