Recommendations
Cites work
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A probabilistic view of Datalog parallelization
- An application of games to the completeness problem for formalized theories
- An optimal lower bound on the number of variables for graph identification
- Bounded arity Datalog \((\neq)\) queries on graphs
- Bounds in the propagation of selection into logic programs
- Datalog programs and their persistency numbers
- Datalog vs first-order logic
- Languages that Capture Complexity Classes
- Number of quantifiers is better than number of tape cells
- On datalog vs polynomial time
- On the expressive power of Datalog: tools and a case study.
- On the power of magic
- Parallel complexity of logical query programs
- The generalized counting method for recursive logic queries
- The parallel complexity of simple logic programs
- Tree canonization and transitive closure
Cited in
(10)- scientific article; zbMATH DE number 1405452 (Why is no real title available?)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
- scientific article; zbMATH DE number 219218 (Why is no real title available?)
- Approximate Query Complexity
- On datalog vs polynomial time
- The expressiveness of DAC
- Mathematical Foundations of Computer Science 2005
- On the complexity of single-rule datalog queries.
- Parallel complexity of logical query programs
- scientific article; zbMATH DE number 4106311 (Why is no real title available?)
This page was built for publication: Inherent complexity of recursive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696953)
