On the hardness of computing maximum self-reduction sequences.
Jeffrey H. KingstonNicholas Paul SheppardPublished in: Discret. Math. (2001)
Keyphrases
- hidden markov models
- computational complexity
- constraint satisfaction
- real time
- bit rate
- biological sequences
- reduction method
- sequence alignment
- maximum number
- learning theory
- sequential patterns
- information theoretic
- action recognition
- np hard
- data structure
- multi agent
- information systems
- artificial intelligence
- databases
- data sets