Expressing polynomials as the permanent of low rank square matrices

DOI10.1016/J.ENDM.2010.05.010MaRDI QIDQ2883553zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The permanent rank of a matrix
• Computing sparse permanents faster
• The permanent of a square matrix
• The factorization of the permanent of a matrix with minimal rank in prime characteristic
• On the complexity of the permanent in various computational models

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 6256206 (Why is no real title available?)
• The factorization of the permanent of a matrix with minimal rank in prime characteristic

This page was built for publication: Expressing polynomials as the permanent of low rank square matrices

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