2 search results - page 1 / 1 » NP-hardness of Deciding Convexity of Quartic Polynomials and... |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...