Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
106
click to vote
CORR
2010
Springer
163
views
Education
»
more
CORR 2010
»
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
14 years 11 months ago
Download
www.optimization-online.org
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...
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Par...
claim paper
Read More »