On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract).
Klaus Ambos-SpiesPublished in: ICALP (1995)
Keyphrases
- extended abstract
- worst case
- special case
- closed form
- databases
- optimal planning
- optimal solution
- search algorithm
- dynamic programming
- closed form expressions
- database
- computationally tractable
- finding optimal
- decision problems
- computational complexity
- feature selection
- information systems
- data mining
- neural network
- data sets