Algebraic branching programs, Algebraic complexity theory, Border complexity, Formula size, Iterated matrix multiplication
R. O'Donnell (Ryan)
dx.doi.org/10.4230/LIPIcs.CCC.2017.20
Position-Based Quantum Cryptography
IEEE Conference on Computational Complexity
This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/617.023.116 - Position-Based Quantum Cryptography
Algorithms and Complexity

Bringmann, K, Ikenmeyer, Ch, & Zuiddam, J. (2017). On algebraic branching programs of small width. In R O'Donnell (Ed.), Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.CCC.2017.20