@InProceedings{blaser_et_al:LIPIcs.CCC.2020.21,
author = {Bl\"{a}ser, Markus and Ikenmeyer, Christian and Mahajan, Meena and Pandey, Anurag and Saurabh, Nitin},
title = {{Algebraic Branching Programs, Border Complexity, and Tangent Spaces}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {21:1--21:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.21},
URN = {urn:nbn:de:0030-drops-125733},
doi = {10.4230/LIPIcs.CCC.2020.21},
annote = {Keywords: Algebraic Branching Programs, Border Complexity, Tangent Spaces, Lower Bounds, Geometric Complexity Theory, Flows, VQP, VNP}
}