"Connection between a class of polynomial optimization problems and maximum ..."

Yanming Chang, Yuejian Peng, Yuping Yao (2016)

> Home

Details and statistics

DOI: 10.1007/S10878-014-9798-X

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ChangPY16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ChangPY16
Yanming Chang, Yuejian Peng, Yuping Yao:
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. J. Comb. Optim. 31(2): 881-892 (2016)

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.