Hardness and inapproximability of minimizing adaptive distinguishing sequences.
Uraz Cengiz TürkerHüsnü YenigünPublished in: Formal Methods Syst. Des. (2014)
Keyphrases
- np hard
- sequential patterns
- neural network
- data structure
- adaptive control
- adaptive learning
- approximation algorithms
- adaptive algorithms
- database
- np hardness
- test sequences
- adaptive filtering
- phase transition
- np complete
- data driven
- worst case
- search algorithm
- objective function
- database systems
- artificial intelligence
- real world