The Computational Complexity of Plethysm Coefficients

Fischer, Nick; Ikenmeyer, Christian

doi:10.1007/s00037-020-00198-4

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The Computational Complexity of Plethysm Coefficients

MPS-Authors

/persons/resource/persons242908

Fischer, Nick
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)

Fischer-Ikenmeyer2020_Article_TheComputationalComplexityOfPl (1).pdf
(Publisher version), 659KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Fischer, N., & Ikenmeyer, C. (2020). The Computational Complexity of Plethysm Coefficients. Computational Complexity, 29(2): 8. doi:10.1007/s00037-020-00198-4.

Cite as: https://hdl.handle.net/21.11116/0000-0007-72D0-D

Abstract

There is no abstract available