On evaluation of permanents
Andreas Bj\"orklund, Thore Husfeldt, Petteri Kaski, Mikko, Koivisto
TL;DR
This paper investigates the computational complexity of calculating matrix permanents over various algebraic structures, focusing on their time and space requirements.
Contribution
It provides new insights into the complexity of permanents over rings and semirings, expanding understanding beyond classical cases.
Findings
Complexity bounds for permanents over rings
Analysis of permanents over semirings
Identification of computational challenges
Abstract
We study the time and space complexity of matrix permanents over rings and semirings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Topics in Algebra · Rings, Modules, and Algebras