NP-hardness of deciding convexity of quartic polynomials and related problems

标题
NP-hardness of deciding convexity of quartic polynomials and related problems
作者
关键词
90C25 Convex programming, 90C60 Abstract computational complexity for mathematical programming problems, 68Q25 Analysis of algorithms & problem complexity
出版物
MATHEMATICAL PROGRAMMING
Volume 137, Issue 1-2, Pages 453-476
出版商
Springer Nature
发表日期
2011-11-29
DOI
10.1007/s10107-011-0499-2

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now