Abstract
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 m≥3. Finally we state and prove several “folklore” results relating different models of computation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
