The Multivariate Resultant Is NP-hard in Any Characteristic.
Bruno GrenetPascal KoiranNatacha PortierPublished in: MFCS (2010)
Keyphrases
- np hard
- scheduling problem
- optimal solution
- special case
- np complete
- closely related
- np hardness
- approximation algorithms
- branch and bound algorithm
- computational complexity
- integer programming
- linear programming
- minimum cost
- greedy heuristic
- multivariate data
- mixed data
- decision problems
- statistical process control
- remains np hard
- knapsack problem
- constraint satisfaction problems
- decision trees
- database
- regression model
- worst case
- control charts
- computationally hard
- empirical bayes
- website
- multivariate gaussian distribution
- neural network