E-Complete Sets Do Not Have Optimal Polynomial Time Approximations.

Pavol Duris José D. P. Rolim

Published in: MFCS (1994)

Keyphrases

worst case
computationally tractable
closed form
special case
optimal design
optimal planning
dynamic programming
databases
machine learning
database
computational complexity
np hard
probabilistic model
approximation algorithms