文章基本信息
- 标题：Dual VP Classes
- 本地全文：下载
- 作者：Eric Allender ; Anna Gal ; Ian Mertz 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We consider arithmetic complexity classes that are in some sense dual to the classes VP(Fp) that were introduced by Valiant. This provides new characterizations of the complexity classes ACC^1 and TC^1, and also provides a compelling example of a class of high-degree polynomials that can be simulated via arithmetic circuits of much lower degree.
- 关键词：arithmetic circuits ; Semiunbounded circuits ; Threshold Circuits
