on the derandomization of the graph test for homomorphism over groups
文献类型：会议论文
| 作者 | Tang Linqing |
| 出版日期 | 2011 |
| 关键词 | Codes (symbols) Random processes Testing |
| 页码 | 1718-1728 |
| 英文摘要 | 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 query complexity and the randomness complexity of the homomorphism test simultaneously. For abelian groups G=Zpm, Γ=Zp and function f:G→Γ, by using a λ-biased set S of size poly(log|G|), we show that, on any given bipartite graph H=(V1,V2;E), there exists a graph test for linearity over G with randomness complexity |V1|log|G|+|V2|O(loglog|G|), query complexity |V1|+|V2|+|E| and if the test accepts f:G→Γ with probability at least p-|E|+(1-p-|E|)δ, then f has agreement |
| 收录类别 | EI |
| 会议录 | Theoretical Computer Science
 |
| 会议录出版地 | Netherlands |
| 语种 | 英语 |
| ISSN号 | 3043975 |
| WOS记录号 | WOS:000288931500008 |
| 源URL | [http://124.16.136.157/handle/311060/14257]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Tang Linqing. on the derandomization of the graph test for homomorphism over groups[C]. 见:. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。