Institutional Repository
| holographic algorithms by fibonacci gates | |
| Cai Jin-Yi; Lu Pinyan; Xia Mingji | |
| 2011 | |
| Source | Linear Algebra and Its Applications |
| Pages | - |
| Indexed Type | ei |
| ISSN | 243795 |
| Department | (1) Computer Sciences Department, University of Wisconsin - Madison, 1210 West Dayton Street, Madison, WI 53706, U.S.A.; (2) Microsoft Research Asia, #999, Zi Xing Road, Min Hang District, Shanghai, 200241, P.R. China; (3) Institute of Software, Chinese Academy of Sciences, #4 South Fourth Street, Zhong Guan Cun, Beijing 100190, P.R. China |
| English Abstract | We introduce Fibonacci gates as a polynomial time computable primitive, and develop a theory of holographic algorithms based on these gates. The Fibonacci gates play the role of matchgates in Valiant's theory (Valiant (2008) [19]). They give rise to polynomial time computable counting problems on general graphs, while matchgates mainly work over planar graphs only. We develop a signature theory and characterize all realizable signatures for Fibonacci gates. For bases of arbitrary dimensions we prove a basis collapse theorem. We apply this theory to give new polynomial time algorithms for certain counting problems. We also use this framework to prove that some slight variations of these counting problems are #P-hard. Holographic algorithms with Fibonacci gates prove to be useful as a general tool for classification results of counting problems (dichotomy theorems (Cai et al. (2009) [7])). © 2011 Elsevier Inc. All rights reserved. |
| Keyword | Polynomial Approximation |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14289 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Cai Jin-Yi,Lu Pinyan,Xia Mingji. holographic algorithms by fibonacci gates[C],2011:-. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| holographic algorith（759KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment