On the Parameterised Complexity of String Morphism Problems.
Henning FernauMarkus L. SchmidYngve VillangerPublished in: Theory Comput. Syst. (2016)
Keyphrases
- decision problems
- data structure
- difficult problems
- information systems
- database
- np complete
- problems involving
- worst case
- solving problems
- computational issues
- learning algorithm
- machine learning
- np hardness
- practical solutions
- practical problems
- complexity bounds
- polynomial hierarchy
- combinatorial optimization
- optimization problems
- multi class
- np hard
- multi objective
- evolutionary algorithm
- artificial neural networks
- computational complexity
- artificial intelligence
- data sets