The factorization of the permanent of a matrix with minimal rank in prime characteristic

DOI10.1007/s10623-011-9501-5zbMath1260.05025OpenAlexW1993796106MaRDI QIDQ663475

David G. Glynn

Publication date: 15 February 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9501-5

zbMATH Keywords

rankpermanentmatrixprime characteristic

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Complexity of computation (including implicit computational complexity) (03D15) Congruences; primitive roots; residue systems (11A07) Matrices, determinants in number theory (11C20)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• An invariant for matrices and sets of points in prime characteristic
• The permanent of a square matrix
• The permanent rank of a matrix
• Two Algorithmic Results for the Traveling Salesman Problem

This page was built for publication: The factorization of the permanent of a matrix with minimal rank in prime characteristic