Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees |
scientific article |
Statements
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (English)
0 references
30 August 2019
0 references
noncommutative arithmetic circuits
0 references
algebraic branching programs
0 references
formulas
0 references
lower bounds
0 references
polynomial identity testing
0 references
parse trees of circuits
0 references
0 references
