Institutional Repository
| holographic algorithms with matchgates capture precisely tractable planar #csp | |
| Cai Jin-Yi; Lu Pinyan; Xia Mingji | |
| 2010 | |
| Conference Name | 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 |
| Source | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| Pages | 427-436 |
| Conference Date | 40839 |
| Conference Place | Las Vegas, NV, United states |
| Indexed Type | ei |
| Publish Place | United States |
| ISSN | 2725428 |
| ISBN | 9780770000000 |
| Department | (1) University of Wisconsin, Madison, WI, United States; (2) Peking University, China; (3) Microsoft Research Asia, United States; (4) Institute of Software, Chinese Academy of Sciences, China |
| English Abstract | Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate computations and holographic algorithms based on them provide a universal methodology to a broad class of counting problems studied in statistical physics community for decades. They capture precisely those problems which are #P-hard on general graphs but computable in polynomial time on planar graphs. More precisely, we prove complexity dichotomy theorems in the framework of counting CSP problems. The local constraint functions take Boolean inputs, and can be arbitrary real-valued symmetric functions. We prove that, every problem in this class belongs to precisely three categories: (1) those which are tractable (i.e., polynomial time computable) on general graphs, or (2) those which are #P-hard on general graphs but tractable on planar graphs, or (3) those which are #P-hard even on planar graphs. The classification criterion is explicit. Moreover, problems in category (2) are tractable on planar graphs precisely by holographic algorithms with matchgates. © 2010 IEEE. |
| Keyword | Boolean Functions Computer Science Graph Theory Graphic Methods Polynomial Approximation |
| Sponsorship | IEEE Comput. Soc. Tech. Comm. Math. Found. Comput. (TCMF); Microsoft Research |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8788 |
| Collection | 2010软件所会议论文 |
| Recommended Citation GB/T 7714 | Cai Jin-Yi,Lu Pinyan,Xia Mingji. holographic algorithms with matchgates capture precisely tractable planar #csp[C]. United States,2010:427-436. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 05671232.pdf（422KB） | 限制开放 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment