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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational complexity Jg. 28; H. 3; S. 471 - 542
Hauptverfasser:	Lagarde, Guillaume, Limaye, Nutan, Srinivasan, Srikanth
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.09.2019 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!