中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共5条，第1-5条 帮助

限定条件                
已选(0)清除 条数/页：   排序方式：
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x] 期刊论文
THEORETICAL COMPUTER SCIENCE, 2019, 卷号: 755, 页码: 89-109
作者:  Jing, Rui-Juan;  Yuan, Chun-Ming;  Gao, Xiao-Shan
收藏  |  浏览/下载：169/0  |  提交时间：2019/03/05
Generalized Hermite normal form  Grobner basis  Polynomial-time algorithm  Z[x] module  
An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank 期刊论文
SCIENCE CHINA-MATHEMATICS, 2018, 卷号: 61, 期号: 5, 页码: 783-796
作者:  Huang, Dandan;  Deng, Yingpu
收藏  |  浏览/下载：150/0  |  提交时间：2018/07/30
deterministic polynomial-time test  Dedekind domains  basis representation  Hermite and Smith normal forms  
The partial inverse minimum spanning tree problem when weight increase is forbidden 期刊论文
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 卷号: 188, 期号: 2, 页码: 348-353
作者:  Cai, Mao-Cheng;  Duin, C. W.;  Yang, Xiaoguang;  Zhang, Jianzhong
收藏  |  浏览/下载：76/0  |  提交时间：2018/07/30
partial inverse problem  spanning tree  weight reduction  polynomial time algorithms  
Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 卷号: 13, 期号: 2, 页码: 123-135
作者:  Yang, Xiaoguang;  Zhang, Jianzhong
收藏  |  浏览/下载：88/0  |  提交时间：2018/07/30
inverse min-max network problem  weighted l(1) norm  weighted l(infinity) norm  bound constraints  polynomial time algorithms  
A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs 期刊论文
JOURNAL OF SYMBOLIC COMPUTATION, 2006, 卷号: 41, 期号: 7, 页码: 739-762
作者:  Feng, Ruyong;  Gao, Xiao-Shan
收藏  |  浏览/下载：117/0  |  提交时间：2018/07/30
rational general solution  first order autonomous ODE  rational parametrizations  Laurent series  Pade approximants  polynomial time algorithm