Expressing polynomials as the permanent of low rank square matrices

DOI10.1016/J.ENDM.2010.05.010zbMATH Open1237.15003OpenAlexW2015993328MaRDI QIDQ2883553FDOQ2883553

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

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

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)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• 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)