Improved construction for universality of determinant and permanent

DOI10.1016/j.ipl.2006.05.017zbMath1185.68016OpenAlexW2045822723MaRDI QIDQ845874

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)

Related Items (1)

Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization

Cites Work

• Feasible arithmetic computations: Valiant's hypothesis
• Unnamed Item

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