Evaluation of permanents in rings and semirings

DOI10.1016/J.IPL.2010.07.005MaRDI QIDQ407582zbMATH OpenOpenAlexFDO

Authors Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto

Publication date 27 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.07.005

zbMATH Keywords

permanentparameterized computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3156818 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• Computational aspects of the Mobius transformation of graphs
• Counting Paths and Packings in Halves
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Evaluation of Permanents
• Expected Computation Time for Hamiltonian Path problem
• Finding, minimizing, and counting weighted subgraphs
• Limits and Applications of Group Algebras for Parameterized Problems
• Relationships between nondeterministic and deterministic tape complexities

Cited in

(7)

• Fast exact algorithms using Hadamard product of polynomials
• Fast monotone summation over disjoint sets
• Invitation to Algorithmic Uses of Inclusion–Exclusion
• Faster exponential-time algorithms in graphs of bounded average degree
• New permanent approximation inequalities via identities
• On explicit branching programs for the rectangular determinant and permanent polynomials
• Colorings with few colors: counting, enumeration and combinatorial bounds

This page was built for publication: Evaluation of permanents in rings and semirings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407582)