On the complexity of the permanent in various computational models
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
2017 Elsevier B.V. We answer a question in [14], showing the regular determinantal complexity of the determinant detm is O(m3). We answer questions in, and generalize results of [2], showing there is no rank one determinantal expression for permm or detm when m3. Finally we state and prove several folklore results relating different models of computation.