PDF-NPhardness of Deciding Convexity of Quartic Polynomial

Author : trish-goza | Published Date : 2015-05-21

Parrilo and John N Tsitsiklis Abstract We show that unless PNP there exists no polynomial time or even pseudopolynomial time algorithm that can decide whether a

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/71469" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "NPhardness of Deciding Convexity of Quar..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

NPhardness of Deciding Convexity of Quartic Polynomial: Transcript

Download Document

Here is the link to download the presentation.
"NPhardness of Deciding Convexity of Quartic Polynomial"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.