On the complexity of searching in trees and partially ordered structures.
Ferdinando CicaleseTobias JacobsEduardo Sany LaberMarco MolinaroPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- partially ordered
- partial order
- partial ordering
- tree structures
- event calculus
- totally ordered
- possibilistic logic
- interval valued
- computational complexity
- tree like structures
- data mining
- worst case
- memory requirements
- tree structure
- computational cost
- decision trees
- knowledge base
- total order
- tree nodes
- learning algorithm
- machine learning