The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete.
Kari-Jouko RäihäEsko UkkonenPublished in: Theor. Comput. Sci. (1981)
Keyphrases
- np complete
- shortest common supersequence
- np hard
- randomly generated
- satisfiability problem
- constraint satisfaction problems
- special case
- non binary
- computational complexity
- scheduling problem
- optimal solution
- phase transition
- minimum cost
- bounded treewidth
- pattern matching
- conjunctive queries
- np complete problems
- pspace complete
- polynomially solvable
- polynomial time complexity
- decision problems
- lower bound
- information systems
- artificial intelligence
- binary data
- finite automata
- databases
- multi class
- machine learning