Institutional Repository
| derandomizing graph tests for homomorphism | |
| Li Angsheng; Tang Linqing | |
| 2008 | |
| Conference Name | 5th International Conference on Theory and Applications of Models of Computation |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 105-115 |
| Conference Date | APR 25-29, |
| Conference Place | Xian, PEOPLES R CHINA |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 978-3-540-79227-7 |
| Department | Li, Angsheng Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China. |
| English Abstract | 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 |
| Keyword | Codes (Symbols) Probability Testing |
| Sponsorship | Xidian Univ, Inst Comp Theory & Technol |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10626 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Li Angsheng,Tang Linqing. derandomizing graph tests for homomorphism[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS,2008:105-115. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| derandomizing graph （428KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment