@online{IL:16,
TITLE = {On the Complexity of the Permanent in Various Computational Models},
AUTHOR = {Ikenmeyer, Christian and Landsberg, J. M.},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1610.00159},
EPRINT = {1610.00159},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results of [Aravind, Joglekar, 2015], showing there is no rank one determinantal expression for perm_m or det_m when m >= 3. Finally we state and prove several "folklore" results relating different models of computation.},
}