Publication:696953

DOI10.1006/JCSS.2001.1806zbMATH Open1015.68028OpenAlexW1969330420MaRDI QIDQ696953FDOQ696953

Stavros S. Cosmandakis

Publication date: 12 September 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1806

zbMATH Keywords

Datalog queries

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel complexity of logical query programs
• An application of games to the completeness problem for formalized theories
• Languages that Capture Complexity Classes
• An optimal lower bound on the number of variables for graph identification
• On the power of magic
• Number of quantifiers is better than number of tape cells
• Datalog vs first-order logic
• On datalog vs polynomial time
• The generalized counting method for recursive logic queries
• Bounded arity Datalog \((\neq)\) queries on graphs
• A probabilistic view of Datalog parallelization
• Bounds in the propagation of selection into logic programs
• Tree canonization and transitive closure
• The parallel complexity of simple logic programs
• Datalog programs and their persistency numbers
• On the expressive power of Datalog: tools and a case study.

Cited In (3)

• Approximate Query Complexity
• Title not available (Why is that?)
• 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05

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)