![](/img/cover-not-exists.png)
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
Chang, Yanming, Peng, Yuejian, Yao, YupingVolume:
31
Language:
english
Journal:
Journal of Combinatorial Optimization
DOI:
10.1007/s10878-014-9798-x
Date:
February, 2016
File:
PDF, 199 KB
english, 2016