2017-07-06
On algebraic branching programs of small width
Publication
Publication
Presented at the
IEEE Conference on Computational Complexity (July 2017), Riga
| Additional Metadata | |
|---|---|
| Keywords | Algebraic branching programs, Algebraic complexity theory, Border complexity, Formula size, Iterated matrix multiplication |
| Editor | R. O'Donnell (Ryan) |
| Persistent URL | dx.doi.org/10.4230/LIPIcs.CCC.2017.20 |
| Project | Position-Based Quantum Cryptography |
| Conference | IEEE Conference on Computational Complexity |
| Grant | This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/617.023.116 - Position-Based Quantum Cryptography |
| Citation |
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
|
