On the complexity of the permanent in various computational models
- Additional Document Info
- View All
© 2017 Elsevier B.V. We answer a question in , showing the regular determinantal complexity of the determinant detm is O(m3). We answer questions in, and generalize results of , showing there is no rank one determinantal expression for permm or detm when m≥3. Finally we state and prove several “folklore” results relating different models of computation.
author list (cited authors)
Ikenmeyer, C., & Landsberg, J. M.