Checking robust nonsingularity is NP-hard.
Svatopluk PoljakJiri RohnPublished in: Math. Control. Signals Syst. (1993)
Keyphrases
- np hard
- np complete
- special case
- data sets
- closely related
- optimal solution
- genetic algorithm
- similarity measure
- search algorithm
- computational complexity
- database systems
- feature selection
- scheduling problem
- computationally efficient
- constraint satisfaction problems
- database
- approximation algorithms
- consistency checking