CORC  > 湖南大学
The connection between polynomial optimization, maximum cliques and Turan densities
Wu, B; Peng, YJ
刊名DISCRETE APPLIED MATHEMATICS
2017
卷号Vol.225页码:114-121
关键词Hypergraph Maximum clique Lagrangian Turan density Polynomial optimization
ISSN号0166-218X
URL标识查看原文
公开日期[db:dc_date_available]
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/6044058
专题湖南大学
作者单位1.Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
2.Hunan Univ, Inst Math, Changsha 410082, Hunan, Peoples R China
推荐引用方式
GB/T 7714
Wu, B,Peng, YJ. The connection between polynomial optimization, maximum cliques and Turan densities[J]. DISCRETE APPLIED MATHEMATICS,2017,Vol.225:114-121.
APA Wu, B,&Peng, YJ.(2017).The connection between polynomial optimization, maximum cliques and Turan densities.DISCRETE APPLIED MATHEMATICS,Vol.225,114-121.
MLA Wu, B,et al."The connection between polynomial optimization, maximum cliques and Turan densities".DISCRETE APPLIED MATHEMATICS Vol.225(2017):114-121.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


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