Approximating the Permanent via Nonabelian Determinants

DOI10.1137/100806709zbMath1247.68102arXiv0906.1702OpenAlexW1592745891MaRDI QIDQ2903520

Alexander Russell, Moore, Cristopher

Publication date: 10 August 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.1702

zbMATH Keywords

approximation algorithmdeterminantpermanent

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

On the hardness of the noncommutative determinant ⋮ Noncommutativity makes determinants hard

This page was built for publication: Approximating the Permanent via Nonabelian Determinants