QQ客服 官方微博 反馈留言

	A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design
	Tong, Chao; Li, Jun; Wen, Jinming
刊名	Cluster Computing
	2019
卷号	22页码:10415-10424
ISSN号	13867857
DOI	10.1007/s10586-017-1032-z
URL标识	查看原文
收录类别	EI
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5914634
专题	北京航空航天大学
推荐引用方式 GB/T 7714	Tong, Chao,Li, Jun,Wen, Jinming. A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design[J]. Cluster Computing,2019,22:10415-10424.
APA	Tong, Chao,Li, Jun,&Wen, Jinming.(2019).A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design.Cluster Computing,22,10415-10424.
MLA	Tong, Chao,et al."A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design".Cluster Computing 22(2019):10415-10424.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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