holographic algorithms by fibonacci gates and holographic reductions for hardness
文献类型：会议论文
| 作者 | Cai Jin-Yi ; Lu Pinyan ; Xia Mingji |
| 出版日期 | 2008 |
| 会议名称 | 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 |
| 会议日期 | 40841 |
| 会议地点 | Philadelphia, PA, United states |
| 关键词 | Computers Hardness Optical devices Polynomial approximation |
| 页码 | 644-653 |
| 英文摘要 | 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 |
| 收录类别 | EI |
| 会议录 | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
 |
| 会议录出版地 | United States |
| 语种 | 英语 |
| ISSN号 | 2725428 |
| ISBN号 | 9780769534367 |
| 源URL | [http://124.16.136.157/handle/311060/10462]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Cai Jin-Yi,Lu Pinyan,Xia Mingji. holographic algorithms by fibonacci gates and holographic reductions for hardness[C]. 见:49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. Philadelphia, PA, United states. 40841. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。