The multivariate quadratic Power Problem over Zn is NP-Complete.
Eligijus SakalauskasPublished in: Inf. Technol. Control. (2012)
Keyphrases
- np complete
- computational complexity
- randomly generated
- np hard
- constraint satisfaction problems
- pspace complete
- conjunctive queries
- satisfiability problem
- computational power
- power consumption
- pairwise
- data sets
- bounded treewidth
- computationally complex
- data complexity
- phase transition
- power distribution
- polynomially solvable
- polynomial time complexity
- np complete problems
- scheduling problem
- lower bound
- objective function