| a computational proof of complexity of some restricted counting problems | |
| Jin-Yi Cai; Pinyan Lu; Mingji Xia | |
| 2010 | |
| 发表期刊 | Theoretical Computer Science
 |
| ISSN | 0304-3975 |
| 页码 | - |
| 收录类别 | sciencedirect,ei |
| 关键词 | Holant Problem Holographic Reduction |
| 部门归属 | a Computer Sciences Department, University of Wisconsin-Madison, Madison, WI 53706, USAb Microsoft Research Asia, Beijing, 100190, PR Chinac State Key Laboratory of Computer Science, Institute of Software, CAS, Beijing, 100190, PR China ; |
| 语种 | 英语 |
| 内容类型 | 期刊论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/9648 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Jin-Yi Cai,Pinyan Lu,Mingji Xia. a computational proof of complexity of some restricted counting problems[J]. Theoretical Computer Science,2010:-. |
| APA | Jin-Yi Cai,Pinyan Lu,&Mingji Xia.(2010).a computational proof of complexity of some restricted counting problems.Theoretical Computer Science,-. |
| MLA | Jin-Yi Cai,et al."a computational proof of complexity of some restricted counting problems".Theoretical Computer Science (2010):-. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| a computational proo（2593KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论