On the Gibson bounds over finite fields.

zbMATH Open1374.15014MaRDI QIDQ2963553FDOQ2963553

Authors: Mikhail V. Budrevich, Alexander Guterman 

Publication date: 14 February 2017

Full work available at URL: http://www.math.bas.bg/serdica/2012/2012-395-416.pdf

Recommendations

• On the Pólya conversion problem for permanents and determinants
• Pólya convertibility problem for symmetric matrices
• On the Gibson barrier for the Pólya problem
• Conversion of the Permanent into the Determinant
• scientific article; zbMATH DE number 17634

zbMATH Keywords

complexitydeterminantfinite fieldspermanent\((0,1)\)-matrixGauss elimination algorithmPólya problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Boolean and Hadamard matrices (15B34) Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Numerical computation of determinants (65F40) Linear transformations, semilinear transformations (15A04)

Cited In (2)

• On the Pólya permanent problem over finite fields
• The sufficient condition of sign conversion for matrices over a finite field

This page was built for publication: On the Gibson bounds over finite fields.

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