中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

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

条数/页: 排序方式:
holographic reduction, interpolation and hardness 期刊论文  OAI收割
COMPUTATIONAL COMPLEXITY, 2012, 卷号: 21, 期号: 4, 页码: 573-604
Cai Jin-Yi; Lu Pinyan; Xia Mingji
  |  收藏  |  浏览/下载:21/0  |  提交时间:2013/09/17
a computational proof of complexity of some restricted counting problems 期刊论文  OAI收割
Theoretical Computer Science, 2010, 页码: -
Jin-Yi Cai; Pinyan Lu; Mingji Xia
  |  收藏  |  浏览/下载:18/0  |  提交时间:2011/05/23
computational complexity of counting problems on 3-regular planar graphs 期刊论文  OAI收割
THEORETICAL COMPUTER SCIENCE, 2007, 卷号: 384, 期号: 1, 页码: 111-125
Xia Mingji; Zhang Peng; Zhao Wenbo
  |  收藏  |  浏览/下载:11/0  |  提交时间:2011/07/01