Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees.
Electronic Colloquium on Computational Complexity (ECCC)(2019)
摘要
We show exponential lower bounds for circuits with up to an exponential number of parse trees, strengthening the work of Lagarde et al. [Electronic Colloquium on Comput Complexity (ECCC) vol 23, no 94, 2016], who prove such a result for Unique Parse Tree (UPT) circuits which have a single parse tree. The polynomial we prove a lower bound for is in fact computable by a polynomial-sized non-commutative circuit.
更多查看译文
关键词
Non-commutative arithmetic circuits, Algebraic branching programs, Formulas, Lower bounds, Polynomial identity testing, Parse trees of circuits, 12Y05, 68Q17, 68Q25
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络