On algebraic branching programs of small width

2017-07-06

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	doi.org/10.4230/LIPIcs.CCC.2017.20
Series	Leibniz International Proceedings in Informatics, LIPIcs: 32nd Computational Complexity Conference
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
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2017). On algebraic branching programs of small width. In R. O'Donnell (Ed.), Computational Complexity Conference (pp. 20:1–20:31). doi:10.4230/LIPIcs.CCC.2017.20

Publication