Reconstruction of Full Rank Algebraic Branching Programs

DOI10.4230/LIPIcs.CCC.2017.21zbMath1440.68081OpenAlexW3197084549MaRDI QIDQ5111151

Sébastien Tavenas, Chandan Saha, Vineet Nair, Neeraj Kayal

Publication date: 26 May 2020

Full work available at URL: https://hal.science/hal-02447472

zbMATH Keywords

Lie algebraalgebraic branching programsiterated matrix multiplicationequivalence testcircuit reconstruction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Randomized algorithms (68W20) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (5)

Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ On the Symmetries of and Equivalence Test for Design Polynomials. ⋮ Linear projections of the Vandermonde polynomial

This page was built for publication: Reconstruction of Full Rank Algebraic Branching Programs