Login / Signup
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.
Harry B. Hunt III
Daniel J. Rosenkrantz
Published in:
Theor. Comput. Sci. (1983)
Keyphrases
</>
np complete
problems involving
database
optimization problems
decision problems
deductive databases
depth map
depth information
three dimensional
image sequences
computational complexity
worst case
domain independent