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žené v:

Podrobná bibliografia
Vydané v:	Computational complexity Ročník 28; číslo 3; s. 471 - 542
Hlavní autori:	Lagarde, Guillaume, Limaye, Nutan, Srinivasan, Srikanth
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.09.2019 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!