The complexity of weighted counting for acyclic conjunctive queries (Q395018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2013.08.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Arithmetization: A new method in structural complexity theory / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of CNF formulas of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted and unweighted \(\#\)CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of counting CSP with complex weights / 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: The complexity of counting homomorphisms seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / 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: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / 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: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and applications for tree-like Weighted Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems / 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: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2013.08.001 / rank
 
Normal rank

Latest revision as of 16:19, 9 December 2024

scientific article
Language Label Description Also known as
English
The complexity of weighted counting for acyclic conjunctive queries
scientific article

    Statements

    The complexity of weighted counting for acyclic conjunctive queries (English)
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    conjunctive queries
    0 references
    counting complexity
    0 references
    0 references

    Identifiers