中文版 | English

在结果中检索

CSpace

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

限定条件    
已选(0)清除 条数/页：   排序方式：
On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
作者:  Chen, Wei-Kun;  Dai, Yu-Hong
收藏  |  浏览/下载：127/0  |  提交时间：2020/05/24
integer programming  sequentially lifted cover inequality  complexity  lifting problem  
A criterion on a repeller being a null set of any limit measure for stochastic differential equations 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 18
作者:  Chen, Lifeng;  Dong, Zhao;  Jiang, Jifa
收藏  |  浏览/下载：169/0  |  提交时间：2020/05/24
stationary measure  limit measure  support  Lyapunov function  repelling limit cycle  repelling quasi-periodic orbits