On Subexponential and FPT-Time Inapproximability.

Edouard Bonnet Bruno Escoffier Eun Jung Kim Vangelis Th. Paschos

Published in: Algorithmica (2015)

Keyphrases

approximation algorithms
data analysis
worst case
random variables
learning algorithm
natural language
computational complexity
evolutionary algorithm
graphical models