On the Complexity of the Permanent in Various Computational Models

Ikenmeyer, Christian; Landsberg, J. M.

doi:10.1016/j.jpaa.2017.02.008

Local TagsRelease HistoryDetailsSummary

On the Complexity of the Permanent in Various Computational Models

Ikenmeyer, C., & Landsberg, J. M. (2017). On the Complexity of the Permanent in Various Computational Models. Journal of Pure and Applied Algebra, 221(12), 2911-2927. doi:10.1016/j.jpaa.2017.02.008.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-4F23-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002E-0822-C

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Ikenmeyer, Christian¹, Author
Landsberg, J. M.², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2017Published Online: 2017-02-23Date issued: 2017

Publication Status: Issued

Pages: 18 pages

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: IL:17
DOI: 10.1016/j.jpaa.2017.02.008

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Pure and Applied Algebra

Other : J. Pure Appl. Algebra

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : North-Holland

Pages: - Volume / Issue: 221 (12) Sequence Number: - Start / End Page: 2911 - 2927 Identifier: ISSN: 0022-4049
CoNE: https://pure.mpg.de/cone/journals/resource/954925417996