Evaluation of permanents in rings and semirings

DOI10.1016/j.ipl.2010.07.005zbMath1234.68145OpenAlexW2049253486MaRDI QIDQ407582

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

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)

Related Items (7)

Fast exact algorithms using Hadamard product of polynomials ⋮ Unnamed Item ⋮ Fast monotone summation over disjoint sets ⋮ Invitation to Algorithmic Uses of Inclusion–Exclusion ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ New permanent approximation inequalities via identities ⋮ Faster exponential-time algorithms in graphs of bounded average degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relationships between nondeterministic and deterministic tape complexities
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Limits and Applications of Group Algebras for Parameterized Problems
• Counting Paths and Packings in Halves
• Expected Computation Time for Hamiltonian Path problem
• Computational aspects of the Mobius transformation of graphs
• Evaluation of Permanents
• Finding, minimizing, and counting weighted subgraphs

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