Diverse Palindromic Factorization is NP-Complete.
Travis GagieShunsuke InenagaJuha KärkkäinenDominik KempaMarcin PiatkowskiSimon J. PuglisiShiho SugimotoPublished in: CoRR (2015)
Keyphrases
- np complete
- np hard
- satisfiability problem
- randomly generated
- computational complexity
- polynomial time complexity
- matrix factorization
- constraint satisfaction problems
- pspace complete
- polynomially solvable
- wide variety
- conjunctive queries
- real world
- np complete problems
- data complexity
- singular value decomposition
- upper bound
- case study
- conp complete
- computationally complex
- database
- kronecker product