derandomizing graph tests for homomorphism

	derandomizing graph tests for homomorphism
	Li Angsheng; Tang Linqing
	2008
会议名称	5th International Conference on Theory and Applications of Models of Computation
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	105-115
会议日期	APR 25-29,
会议地点	Xian, PEOPLES R CHINA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
ISSN	0302-9743
ISBN	978-3-540-79227-7
部门归属	Li, Angsheng Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
摘要	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
关键词	Codes (Symbols) Probability Testing
主办者	Xidian Univ, Inst Comp Theory & Technol
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10626
专题	基础软件与系统重点实验室
推荐引用方式 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.