Lower bounds for Pólya’s problem on permanent

DOI10.1142/S0218196716500521zbMath1347.05108MaRDI QIDQ2828348

M. V. Budrevich, Bojan Kuzma, Gregor Dolinar, Alexander E. Guterman

Publication date: 25 October 2016

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

lower boundsindecomposable matricesPólya's problem

Mathematics Subject Classification ID

Commutativity of matrices (15A27) Linear transformations, semilinear transformations (15A04) Connectivity (05C40)

Related Items (1)

Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones

Cites Work

• The complexity of computing the permanent
• Pólya's permanent problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for Pólya’s problem on permanent