Simplified derandomization of BPP using a hitting set generator.
Studies in complexity and cryptography（2000）
摘要
A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit. A polynomial time hitting-set generator readily implies RP = P, but it is not apparent what this implies for BPP. Nevertheless, Andreev et al. (ICALP'96, and JACM 1998) showed that a polynomial-time hitting-set generator implies the seemingly stronger conclusion BPP = P. We simplify and improve their (and later) constructions.
更多查看译文
关键词
simplified derandomization,polynomial time hitting-set generator,polynomial-time hitting-set generator,deterministic algorithm,stronger conclusion,small circuit,dense set,hitting-set generator,polynomial time
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要