Improved construction for universality of determinant and permanent

DOI10.1016/J.IPL.2006.05.017MaRDI QIDQ845874zbMATHOpenAlexFDO

Authors Hong Liu, Kenneth W. Regan

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.05.017

zbMATH Keywords

computational complexitydeterminantpermanentalgebraic formula size

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• A generalization of permanents and determinants
• Improvement on determinant definition and nature proving
• A determinantal inequality and its permanental counterpart
• Approximating the permanent via nonabelian determinants
• Determinant, permanent, and MacMahon's master theorem
• Permanent versus determinant, obstructions, and Kronecker coefficients
• On the matrices with constant determinant and permanent over roots of unity.
• Permanents, determinants, and generalized complementary basic matrices
• On two determinantal identities and their permanent analogues
• Construction of hyperdeterminants

Cites work

• scientific article; zbMATH DE number 1996521 (Why is no real title available?)
• Feasible arithmetic computations: Valiant's hypothesis

Cited in

(2)

• Subspace arrangements, graph rigidity and derandomization through submodular optimization
• Multi-linear formulas for permanent and determinant are of super-polynomial size

This page was built for publication: Improved construction for universality of determinant and permanent

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