On the Gibson barrier for the Pólya problem
From MaRDI portal
Publication:1930200
DOI10.1007/s10958-012-0912-2zbMath1259.15009OpenAlexW2071298058MaRDI QIDQ1930200
Bojan Kuzma, Alexander E. Guterman, Gregor Dolinar
Publication date: 10 January 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0912-2
determinantlower boundspermanent\((0,1)\) matricesGibson barriernumber of nonzero entriesPólya problem
Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36)
Related Items (2)
On the Pólya conversion problem for permanents and determinants ⋮ Construction of nonconvertible \((0,1)\) matrices
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- On the relation between the determinant and the permanent
- Signsolvability revisited
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Pólya's permanent problem
- An Identity Between Permanents and Determinants
- Conversion of the Permanent into the Determinant
This page was built for publication: On the Gibson barrier for the Pólya problem