Institutional Repository
| a computational proof of complexity of some restricted counting problems | |
| Jin-Yi Cai; Pinyan Lu; Mingji Xia | |
| 2010 | |
| Source | Theoretical Computer Science
 |
| ISSN | 0304-3975 |
| Pages | - |
| Indexed Type | sciencedirect,ei |
| Keyword | Holant Problem Holographic Reduction |
| Department | 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 ; |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/9648 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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):-. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a computational proo（2593KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment