Search Results - "68Q25: Analysis of algorithms and problem complexity"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    Cover Image

    NP-hardness of deciding convexity of quartic polynomials and related problems by Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer-Verlag 01.02.2013
    Published in Mathematical programming (01.02.2013)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: