The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.

Harry B. Hunt III Daniel J. Rosenkrantz

Published in: J. Comput. Syst. Sci. (1984)

Keyphrases

deductive databases
worst case
datalog programs
complex objects
database
average case complexity
information systems
computational complexity
data sets
average case
lower bound
databases
data exchange
decision problems
upper bound
space complexity
complexity analysis
upper and lower bounds
information retrieval