中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 2010软件所会议论文
题名:
holographic algorithms with matchgates capture precisely tractable planar #csp
作者: Cai Jin-Yi ; Lu Pinyan ; Xia Mingji
会议文集: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
会议名称: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
会议日期: 40839
出版日期: 2010
会议地点: Las Vegas, NV, United states
关键词: Boolean functions ; Computer science ; Graph theory ; Graphic methods ; Polynomial approximation
出版地: United States
收录类别: ei
ISSN: 2725428
ISBN: 9780770000000
部门归属: (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
主办者: IEEE Comput. Soc. Tech. Comm. Math. Found. Comput. (TCMF); Microsoft Research
英文摘要: 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.
语种: 英语
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8788
Appears in Collections:中科院软件所图书馆_2010软件所会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
05671232.pdf(422KB)----限制开放-- 联系获取全文

Recommended Citation:
Cai Jin-Yi,Lu Pinyan,Xia Mingji. holographic algorithms with matchgates capture precisely tractable planar #csp[C]. 见:2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. Las Vegas, NV, United states. 40839.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Cai Jin-Yi]'s Articles
[Lu Pinyan]'s Articles
[Xia Mingji]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Cai Jin-Yi]‘s Articles
[Lu Pinyan]‘s Articles
[Xia Mingji]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

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