文章基本信息
- 标题：Circuit Lower Bounds for Heuristic MA
- 本地全文：下载
- 作者：Alexander Knop
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2013
- 卷号：2013
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
Santhanam (2007) proved that MA/1 does not have circuits of size nk. We translate his result to the heuristic setting by proving that there is a constant a such that for any k, there is a language in HeurMA that cannot be solved by circuits of size nk on more than the 1−1na fraction of inputs.
In order to get rid of the non-uniform advice, we supply the inputs with the probability hreshold thatwe use to determine the acceptance. This technique was used by Pervyshev (2007) for proving a time hierarchy for heuristic computations.
- 关键词：fixed-polynomial lower bounds; heuristic classes; Merlin-Arthur proofs
