On the Complexity of the Permanent in Various Computational Models

Ikenmeyer, Christian; Landsberg, J. M.

doi:10.1016/j.jpaa.2017.02.008

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

On the Complexity of the Permanent in Various Computational Models

MPS-Authors

/persons/resource/persons202366

Ikenmeyer, Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-4F23-D

Abstract

There is no abstract available