| Title: | derandomizing graph tests for homomorphism |
| Author: | Li Angsheng
; Tang Linqing
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | 5th International Conference on Theory and Applications of Models of Computation
|
| Conference Date: | APR 25-29,
|
| Issued Date: | 2008
|
| Conference Place: | Xian, PEOPLES R CHINA
|
| Keyword: | Codes (symbols)
; Probability
; Testing
|
| Publisher: | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 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.
|
| Sponsorship: | Xidian Univ, Inst Comp Theory & Technol
|
| 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 |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/10626
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| derandomizing graph tests for homomorphism.pdf（428KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
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,.
|
|
|
