Finding a root of constrained quadratic polynomial system is NP-hard.
Marcelo S. ReisPublished in: CoRR (2018)
Keyphrases
- np hard
- special case
- computational complexity
- approximation algorithms
- linear programming
- finding the optimal solution
- optimal solution
- lower bound
- scheduling problem
- neural network
- machine learning
- integer programming
- decision problems
- remains np hard
- sequential quadratic programming
- closely related
- np complete
- worst case
- pairwise
- objective function
- social networks
- real world