CSpace

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

限定条件        
已选(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
收藏  |  浏览/下载:178/0  |  提交时间:2019/03/05
Generalized Hermite normal form  Grobner basis  Polynomial-time algorithm  Z[x] module  
Computation of arbitrage in frictional bond markets 期刊论文
THEORETICAL COMPUTER SCIENCE, 2006, 卷号: 363, 期号: 3, 页码: 248-256
作者:  Cai, Mao-cheng;  Deng, Xiaotie;  Li, Zhongfei
收藏  |  浏览/下载:121/0  |  提交时间:2018/07/30
frictional market  weak no-arbitrage  computational complexity  NP-hard  
K-center and K-median problems in graded distances 期刊论文
THEORETICAL COMPUTER SCIENCE, 1998, 卷号: 207, 期号: 1, 页码: 181-192
作者:  Lin, GH;  Xue, GL
收藏  |  浏览/下载:109/0  |  提交时间:2018/07/30
the k-center problem  the k-median problem  graded distance matrix  computational complexity