derandomizing graph tests for homomorphism
文献类型：会议论文
| 作者 | Li Angsheng ; Tang Linqing |
| 出版日期 | 2008 |
| 会议名称 | 5th International Conference on Theory and Applications of Models of Computation |
| 会议日期 | APR 25-29, |
| 会议地点 | Xian, PEOPLES R CHINA |
| 关键词 | Codes (symbols) Probability Testing |
| 页码 | 105-115 |
| 英文摘要 | In this article, we study the randomness-efficient graph tests for homomorphism over arbitrary groups (which can be used in locally testing the Hadamard code and PCP construction). We try to optimize both the amortized-tradeoff (between number |
| 会议主办者 | Xidian Univ, Inst Comp Theory & Technol |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| ISSN号 | 0302-9743 |
| ISBN号 | 978-3-540-79227-7 |
| 源URL | [http://124.16.136.157/handle/311060/10626]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Li Angsheng,Tang Linqing. derandomizing graph tests for homomorphism[C]. 见:5th International Conference on Theory and Applications of Models of Computation. Xian, PEOPLES R CHINA. APR 25-29,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。