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

Search Results

Help

Item hits: (Results 1-2 of 2)

Items/Page:    Sort:
a computational proof of complexity of some restricted counting problems [会议论文]
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Cai Jin-Yi; Lu Pinyan; Xia Mingji
  |  
 
approximation and hardness results for label cut and related problems [会议论文]
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

 

1

 

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