Diverse Palindromic Factorization is NP-Complete.
Hideo BannaiTravis GagieShunsuke InenagaJuha KärkkäinenDominik KempaMarcin PiatkowskiShiho SugimotoPublished in: Int. J. Found. Comput. Sci. (2018)
Keyphrases
- np complete
- np hard
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- polynomial time complexity
- computational complexity
- conjunctive queries
- bounded treewidth
- real world
- low rank
- matrix factorization
- pairwise
- phase transition
- computationally complex
- kronecker product
- singular value decomposition
- optimal solution
- case study
- polynomially solvable
- non rigid structure from motion
- neural network