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

Amir Ali Ahmadi et al. (2013)

> Home

Details and statistics

DOI: 10.1007/S10107-011-0499-2

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/AhmadiOPT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/AhmadiOPT13
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis:
NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1-2): 453-476 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.