中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-10 of 16)

Filters    
Items/Page:    Sort:
characterizations of one-way general quantum finite automata [期刊论文]
Theoretical Computer Science, 2011-01-01, 卷号: 419, 页码: -
Lvzhou Li; Daowen Qiu; Xiangfu Zou; Lvjun Li; Lihua Wu; Paulo Mateus

 
the loop formula based semantics of description logic programs [期刊论文]
Theoretical Computer Science, 2011-01-01, 卷号: 415, 页码: -
Yisong Wang; Jia-Huai You; Li Yan Yuan; Yi-Dong Shen; Mingyi Zhang

 
characterizations of locally testable linear- and affine-invariant families [期刊论文]
Theoretical Computer Science, 2011-01-01, 卷号: 414, 期号: 1, 页码: 55-75
Angsheng Li; Yicheng Pan

 
on the number of infinite sequences with trivial initial segment complexity [期刊论文]
Theoretical Computer Science, 2011-01-01, 卷号: 412, 期号: 52, 页码: 7133-7146
George Barmpalias; T.F. Sterkenburg

 
a computational proof of complexity of some restricted counting problems [期刊论文]
Theoretical Computer Science, 2010-01-01, 页码: -
Jin-Yi Cai; Pinyan Lu; Mingji Xia
  |  
 
an approximation algorithm to the k-steiner forest problem [期刊论文]
THEORETICAL COMPUTER SCIENCE, 2009-01-01, 卷号: 410, 期号: 11, 页码: 1093-1098
Zhang Peng; Xia Mingji

 
elementary differences among jump classes [期刊论文]
Theoretical Computer Science, 2009-01-01, 卷号: 410, 期号: 11, 页码: 1042-1053
Li Angsheng
  |  
 
a new approximation algorithm for the k-facility location problem [期刊论文]
THEORETICAL COMPUTER SCIENCE, 2007-01-01, 卷号: 384, 期号: 1, 页码: 126-135
Zhang Peng
  |  
 
computational complexity of counting problems on 3-regular planar graphs [期刊论文]
THEORETICAL COMPUTER SCIENCE, 2007-01-01, 卷号: 384, 期号: 1, 页码: 111-125
Xia Mingji; Zhang Peng; Zhao Wenbo
  |  
 
structure of proofs and the complexity of cut elimination [期刊论文]
Theoretical Computer Science, 2006-01-01, 卷号: 353, 期号: 40181, 页码: 63-70
Zhang Wenhui
  |  
 

1 2 next

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace