A Priestley Sum of Finite Trees is Acyclic.
Richard N. BallAles PultrJirí SichlerPublished in: Appl. Categorical Struct. (2008)
Keyphrases
- binary valued
- decision trees
- np hard
- tree structures
- database schemes
- tree structure
- linear functions
- bayesian networks
- finite number
- tree automata
- boolean expressions
- join dependencies
- machine learning
- unit length
- square error
- compact representations
- tree construction
- real numbers
- np complete
- computational complexity
- data structure