Lower bounds for Pólya's problem on permanent

DOI10.1142/S0218196716500521zbMATH Open1347.05108MaRDI QIDQ2828348FDOQ2828348

Authors: Mikhail V. Budrevich, Bojan Kuzma, Gregor Dolinar, Alexander Guterman 

Publication date: 25 October 2016

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

Recommendations

• On the Gibson barrier for the Pólya problem
• A lower bound for permanents of (0,1)-matrices
• Permanents -- a concise survey
• Pólya convertibility problem for symmetric matrices
• The upper bound and lower bound for the permanent of \((0,1)\)-matrices

zbMATH Keywords

lower boundsindecomposable matricesPólya's problem

Mathematics Subject Classification ID

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

Cites Work

• Pólya's permanent problem
• The complexity of computing the permanent
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones
• Title not available (Why is that?)
• On the Gibson barrier for the Pólya problem

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

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