Hypertree decompositions and tractable queries (Q696962): Difference between revisions

@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Power of Natural Semijoins
@@ Property / cites work: Power of Natural Semijoins / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction from a deductive viewpoint
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Tree clustering for constraint networks
@@ Property / cites work: Tree clustering for constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of acyclicity for hypergraphs and relational database schemes
+Normal rank
@@ Property / cites work @@
+A simplied universal relation assumption and its properties
+Normal rank
@@ Property / cites work @@
+A sufficient condition for backtrack-bounded search
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree queries
@@ Property / cites work: Tree queries / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of acyclic conjunctive queries
@@ Property / cites work: The complexity of acyclic conjunctive queries / rank @@
+Normal rank
@@ Property / cites work @@
+Computing LOGCFL certificates
@@ Property / cites work: Computing LOGCFL certificates / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of structural CSP decomposition methods
+Normal rank
@@ Property / cites work @@
+Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing constraint satisfaction problems using database techniques
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Tree-size bounded alternation
@@ Property / cites work: Tree-size bounded alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity theory based on Boolean algebra
@@ Property / cites work: A complexity theory based on Boolean algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142695
@@ Property / cites work: Q4142695 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+The well-founded semantics for general logic programs
+Normal rank
@@ Property / cites work @@
+On Determining Tree Query Membership Of A Distributed Query
+Normal rank
@@ Property / Wikidata QID @@
+Q59259717
@@ Property / Wikidata QID: Q59259717 / rank @@
+Normal rank