Expressing Polynomials as the Permanent of low rank Square Matrices

DOI10.1016/j.endm.2010.05.010zbMath1237.15003OpenAlexW2015993328MaRDI QIDQ2883553

Mumtaz Ahmad

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.010

zbMATH Keywords

combinatorial optimizationpolynomialspermanentalgorithm complexity

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to linear algebra (15-04) Special matrices (15B99)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Calculation of the permanent of a sparse positive matrix
• A Monte-Carlo Algorithm for Estimating the Permanent
• Two Algorithmic Results for the Traveling Salesman Problem
• Permanents

This page was built for publication: Expressing Polynomials as the Permanent of low rank Square Matrices