English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On the Complexity of the Permanent in Various Computational Models

Ikenmeyer, C., & Landsberg, J. M. (2016). On the Complexity of the Permanent in Various Computational Models. Retrieved from http://arxiv.org/abs/1610.00159.

Item is

Files

show Files
hide Files
:
arXiv:1610.00159.pdf (Preprint), 217KB
Name:
arXiv:1610.00159.pdf
Description:
File downloaded from arXiv at 2017-01-30 12:28
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Ikenmeyer, Christian1, Author           
Landsberg, J. M.2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Computer Science, Computational Complexity, cs.CC,
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2016-10-012016
 Publication Status: Published online
 Pages: 18 pages
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1610.00159
URI: http://arxiv.org/abs/1610.00159
BibTex Citekey: IL:16
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show