Institutional Repository
| holographic algorithms by fibonacci gates and holographic reductions for hardness | |
| Cai Jin-Yi; Lu Pinyan; Xia Mingji | |
| 2008 | |
| Conference Name | 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 |
| Source | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| Pages | 644-653 |
| Conference Date | 40841 |
| Conference Place | Philadelphia, PA, United states |
| Indexed Type | ei |
| Publish Place | United States |
| ISSN | 2725428 |
| ISBN | 9780769534367 |
| Department | (1) Computer Sciences Department, University of Wisconsin-Madison, Harvard University; (2) Institute for Theoretical Computer Science, Tsinghua University; (3) Institute of Software, Chinese Academy of Sciences |
| English Abstract | We propose a new method to prove complexity dichotomy theorems. First we introduce Fibonacci gates which provide a new class of polynomial time holographic algorithms. Then we develop holographic reductions. We show that holographic reductions followed by |
| Keyword | Computers Hardness Optical Devices Polynomial Approximation |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10462 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Cai Jin-Yi,Lu Pinyan,Xia Mingji. holographic algorithms by fibonacci gates and holographic reductions for hardness[C]. United States,2008:644-653. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04690997.pdf（343KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment