Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees

We investigate the power of Non-commutative Arithmetic Circuits , which compute polynomials over the free non-commutative polynomial ring F ⟨ x 1 , … , x N ⟩ , where variables do not commute. We consider circuits that are restricted in the ways in which they can compute monomials: this can be seen a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational complexity Ročník 28; číslo 3; s. 471 - 542
Hlavní autoři: Lagarde, Guillaume, Limaye, Nutan, Srinivasan, Srikanth
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.09.2019
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Arithmetic
Circuits
Computation
Computational Mathematics and Numerical Analysis
Computer Science
Lower bounds
Polynomials
Production scheduling
Rings (mathematics)
Trees
Lower bounds
68Q25
Parse trees of circuits
Algebraic branching programs
68Q17
12Y05
Non-commutative arithmetic circuits
Formulas
Polynomial identity testing
ISSN:1016-3328, 1420-8954
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate the power of Non-commutative Arithmetic Circuits , which compute polynomials over the free non-commutative polynomial ring F ⟨ x 1 , … , x N ⟩ , where variables do not commute. We consider circuits that are restricted in the ways in which they can compute monomials: this can be seen as restricting the families of parse trees that appear in the circuit. Such restrictions capture essentially all non-commutative circuit models for which lower bounds are known. We prove several results about such circuits. 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. We show exponential lower bounds for circuits whose parse trees are rotations of a single tree. This simultaneously generalizes recent lower bounds of Limaye et al . (Theory Comput 12(1):1–38, 2016 ) and the above lower bounds of Lagarde et al . ( 2016 ), which are known to be incomparable. Here too, the hard polynomial is computable by a polynomial-sized non-commutative circuit. We make progress on a question of Nisan (STOC, pp 410–418, 1991 ) regarding separating the power of Algebraic Branching Programs (ABPs) and Formulas in the non-commutative setting by showing a tight lower bound of n Ω ( log d ) for any UPT formula computing the product of d n × n matrices. When d ≤ log n , we can also prove superpolynomial lower bounds for formulas with up to 2 o ( d ) many parse trees (for computing the same polynomial). Improving this bound to allow for 2 o ( d ) trees would give an unconditional separation between ABPs and Formulas. We give deterministic whitebox PIT algorithms for UPT circuits over any field, strengthening a result of Lagarde et al . ( 2016 ), and also for sums of a constant number of UPT circuits with different parse trees.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1016-3328
1420-8954
DOI:10.1007/s00037-018-0171-9