On the Space and Access Complexity of Computation DAGs.
Gianfranco BilardiAndrea PietracaprinaPaolo D'AlbertoPublished in: WG (2000)
Keyphrases
- space time
- computational complexity
- worst case
- space requirements
- low dimensional
- space complexity
- genetic algorithm
- previously computed
- equivalence classes
- higher dimensional
- image sequences
- parameter space
- directed acyclic graph
- decision problems
- access control
- complexity analysis
- case study
- space reduction
- real time