Inherent complexity of recursive queries
type: Item
instance of: scholarly article
title: Inherent complexity of recursive queries
zbMATH Open document ID: 1015.68028
published in: Journal of Computer and System Sciences
publication date: 2002-09-12T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1800305
zbMATH Keywords: Datalog queries
author: Stavros S. Cosmandakis
MaRDI profile type: MaRDI publication profile
full work available at URL: jcss.2001.1806
OpenAlex ID: W1969330420
cites work: Q4864249
cites work: Bounded arity Datalog \((\neq)\) queries on graphs
cites work: On datalog vs polynomial time
cites work: Datalog programs and their persistency numbers
cites work: Datalog vs first-order logic
cites work: The parallel complexity of simple logic programs
cites work: Bounds in the propagation of selection into logic programs
cites work: On the power of magic
cites work: An optimal lower bound on the number of variables for graph identification
cites work: An application of games to the completeness problem for formalized theories
cites work: Tree canonization and transitive closure
cites work: Q3230355
cites work: Q3666827
cites work: Q4198056
cites work: Number of quantifiers is better than number of tape cells
cites work: Languages that Capture Complexity Classes
cites work: On the expressive power of Datalog: tools and a case study.
cites work: A probabilistic view of Datalog parallelization
cites work: The generalized counting method for recursive logic queries
cites work: Parallel complexity of logical query programs
DOI: 10.1006/JCSS.2001.1806
description: scientific article; zbMATH DE number 1800305