On the computational hardness based on linear FPT-reductions.

Jianer Chen Xiuzhen Huang Iyad A. Kanj Ge Xia

Published in: J. Comb. Optim. (2006)

Keyphrases

learning theory
np hard
information theoretic
databases
neural network
machine learning
feature selection
case study
computational complexity
closed form
linear model
linear constraints
cutting plane
simple linear