中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
软件研究所 [8]
数学与系统科学研究院 [2]
采集方式
OAI收割 [10]
内容类型
会议论文 [8]
期刊论文 [2]
发表日期
2015 [2]
2012 [1]
2011 [2]
2009 [3]
2008 [2]
学科主题
筛选
浏览/检索结果:
共10条,第1-10条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Gravitational wave astronomy: the current status
期刊论文
OAI收割
SCIENCE CHINA-PHYSICS MECHANICS & ASTRONOMY, 2015, 卷号: 58, 期号: 12, 页码: 41
作者:
Blair David
;
Ju Li
;
Zhao ChunNong
;
Wen LinQing
;
Chu Qi
  |  
收藏
  |  
浏览/下载:41/0
  |  
提交时间:2018/07/30
gravitational waves
ground based detectors
pulsar timing
spaced based detectors
CMB
gravitationalwaveastronomythecurrentstatus
期刊论文
OAI收割
sciencechinaphysicsmechanicsastronomy, 2015, 卷号: 58, 期号: 12
作者:
Blair David
;
Ju Li
;
Zhao Chunnong
;
Wen Linqing
;
Chu Qi
  |  
收藏
  |  
浏览/下载:47/0
  |  
提交时间:2020/01/10
approximating minimum label s-t cut via linear programming
会议论文
OAI收割
10th Latin American Symposiumon Theoretical Informatics, LATIN 2012, Arequipa, Peru, April 16, 2012 - April 20, 2012
Tang Linqing
;
Zhang Peng
  |  
收藏
  |  
浏览/下载:12/0
  |  
提交时间:2013/09/22
Approximation algorithms
Distributed computer systems
Information science
the complexity and approximability of minimum contamination problems
会议论文
OAI收割
Theory and Applications of Models of Computation 8th Annual Conference, TAMC 2011, Tokyo Japan, 2011
Li Angsheng
;
Tang Linqing
收藏
  |  
浏览/下载:11/0
  |  
提交时间:2011/10/10
Approximation algorithms
Computational complexity
Water cooling systems
on the derandomization of the graph test for homomorphism over groups
会议论文
OAI收割
Tang Linqing
  |  
收藏
  |  
浏览/下载:16/0
  |  
提交时间:2011/10/10
Codes (symbols)
Random processes
Testing
conditional hardness of approximating satisfiable max 3csp-q
会议论文
OAI收割
20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, DEC 16-18,
Tang Linqing
  |  
收藏
  |  
浏览/下载:13/0
  |  
提交时间:2011/03/20
Computer operating procedures
Hardness
principal filters definable by parameters in e-bt
会议论文
OAI收割
4th International Conference on Theory and Applications of Models of Computation, Shanghai, PEOPLES R CHINA, MAY 22-25,
Li Angsheng
;
Li Weilin
;
Pani Yicheng
;
Tang Linqing
  |  
收藏
  |  
浏览/下载:17/0
  |  
提交时间:2011/03/20
approximation and hardness results for label cut and related problems
会议论文
OAI收割
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Zhang Peng
;
Cai Jin-Yi
;
Tang Linqing
;
Zhao Wenbo
收藏
  |  
浏览/下载:17/0
  |  
提交时间:2011/03/20
Approximation algorithms
Combinatorial optimization
Computational complexity
Graph theory
Hardness
definable filters in the structure of bounded turing reductions
会议论文
OAI收割
5th International Conference on Theory and Applications of Models of Computation, Xian, PEOPLES R CHINA, APR 25-29,
Li Angsheng
;
Li Weilin
;
Paul Yicheng
;
Tang Linqing
  |  
收藏
  |  
浏览/下载:20/0
  |  
提交时间:2011/06/13
derandomizing graph tests for homomorphism
会议论文
OAI收割
5th International Conference on Theory and Applications of Models of Computation, Xian, PEOPLES R CHINA, APR 25-29,
Li Angsheng
;
Tang Linqing
  |  
收藏
  |  
浏览/下载:17/0
  |  
提交时间:2011/06/13
Codes (symbols)
Probability
Testing