The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers.
Frank DrewesPublished in: Inf. Comput. (2001)
Keyphrases
- exponential size
- space complexity
- computational complexity
- memory requirements
- worst case time complexity
- maximal cliques
- neural network
- polynomial size
- linear complexity
- binary tree
- real time
- space requirements
- index structure
- worst case
- network size
- computational cost
- machine learning
- r tree
- b tree
- decision problems
- phylogenetic trees
- finite automata
- data structure
- average case complexity
- increase in computational complexity