scientific article; zbMATH DE number 7650909

DOI10.4230/LIPICS.STACS.2020.24MaRDI QIDQ5874295zbMATH OpenFDO

Authors Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2020.24

zbMATH Keywords

arithmetic circuit complexityHankel matrixlower boundsparse trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Lower bounds for arithmetic circuits via the Hankel matrix
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
• Arithmetic circuit lower bounds via MaxRank
• Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
• scientific article; zbMATH DE number 7204375

Cited in

(2)

• Lower bounds for arithmetic circuits via the Hankel matrix
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees

This page was built for publication:

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