@InProceedings{kayal_et_al:LIPIcs.CCC.2017.21,
author = {Kayal, Neeraj and Nair, Vineet and Saha, Chandan and Tavenas, S\'{e}bastien},
title = {{Reconstruction of Full Rank Algebraic Branching Programs}},
booktitle = {32nd Computational Complexity Conference (CCC 2017)},
pages = {21:1--21:61},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-040-8},
ISSN = {1868-8969},
year = {2017},
volume = {79},
editor = {O'Donnell, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.21},
URN = {urn:nbn:de:0030-drops-75318},
doi = {10.4230/LIPIcs.CCC.2017.21},
annote = {Keywords: Circuit reconstruction, algebraic branching programs, equivalence test, iterated matrix multiplication, Lie algebra}
}