Diverse Palindromic Factorization Is NP-complete.
Hideo BannaiTravis GagieShunsuke InenagaJuha KärkkäinenDominik KempaMarcin PiatkowskiSimon J. PuglisiShiho SugimotoPublished in: DLT (2015)
Keyphrases
- np complete
- randomly generated
- computational complexity
- satisfiability problem
- np hard
- pairwise
- real world
- polynomial time complexity
- constraint satisfaction problems
- computationally complex
- wide variety
- pspace complete
- matrix factorization
- singular value decomposition
- bounded treewidth
- low rank
- conjunctive queries
- database
- bayesian networks
- conp complete
- case study
- knowledge base
- kronecker product