On the hardness of the determinant: sum of regular set-multilinear circuits

DOI10.1007/978-3-030-86593-1_30OpenAlexW3201884329MaRDI QIDQ2140523

Yanyan Li

Publication date: 20 May 2022

Full work available at URL: https://arxiv.org/abs/2109.10094

zbMATH Keywords

hardness of determinantregular set-multilinear circuitsset-multilinear circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• On computing the determinant in small parallel time using a small number of processors
• Non-commutative circuits and the sum-of-squares problem
• On the hardness of the noncommutative determinant
• Multi-linear formulas for permanent and determinant are of super-polynomial size

This page was built for publication: On the hardness of the determinant: sum of regular set-multilinear circuits