Pages that link to "Item:Q3196620"

The following pages link to The complexity of acyclic conjunctive queries (Q3196620):

Displaying 38 items.

• The arithmetic complexity of tensor contraction (Q290898) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Equivalence between hypergraph convexities (Q410668) (← links)
• Generic local computation (Q414892) (← links)
• Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
• Hypertree decompositions and tractable queries (Q696962) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• A more general theory of static approximations for conjunctive queries (Q778535) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• How hard is completeness reasoning for conjunctive queries? (Q2019449) (← links)
• Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
• Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
• Prediction-hardness of acyclic conjunctive queries (Q2581365) (← links)
• The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) (← links)
• Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
• (Q4553282) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
• Theory and Applications of Satisfiability Testing (Q5714771) (← links)
• Automata, Languages and Programming (Q5716778) (← links)
• Computing LOGCFL certificates (Q5958329) (← links)
• Rewriting with Acyclic Queries: Mind Your Head (Q6178695) (← links)
• Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)
• Linking entities across relations and graphs (Q6536402) (← links)
• Inconsistency- and error-tolerant reasoning w.r.t. optimal repairs of \(\mathcal{EL}^\bot\) ontologies (Q6630183) (← links)