@inproceedings{M-Arithmetic-Branching-Programs-With-Memory,
Title = {Arithmetic Branching Programs with Memory},
Author = {Stefan Mengel},
Booktitle = {Mathematical foundations of computer science 2013},
Pages = {667-678},
Year = {2013},
Doi = {10.1007/978-3-642-40313-2_59},
Volume = {8087},
Publisher = {Springer, Heidelberg},
Abstract = {We extend the well known characterization of VP_ws as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of branching programs to make them more expressive. We show that allowing different types of memory in branching programs increases the computational power even for constant width programs. In particular, this leads to very natural and robust characterizations of VP and VNP by branching programs with memory.},
Url = {http://arxiv.org/abs/1303.1969},
Url2 = {http://www3.math.tu-berlin.de/algebra/work/realizable.pdf},
Reviewed = {True}
}