CORC

浏览/检索结果: 共2条,第1-2条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 卷号: Vol.31 No.2, 页码: 881-892
作者:  Chang, Yanming;  Peng, Yuejian;  Yao, Yuping
收藏  |  浏览/下载:5/0  |  提交时间:2019/12/31
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 卷号: Vol.31 No.2, 页码: 881-892
作者:  Chang, Yanming;  Peng, Yuejian;  Yao, Yuping
收藏  |  浏览/下载:5/0  |  提交时间:2019/12/31


©版权所有 ©2017 CSpace - Powered by CSpace