Homogeneous depth-five lower bounds for iterated matrix multiplication
Let $\mathop{\mathrm{IMM}}\nolimits _{n,n}$ be the $(1,1)$ entry of a product of n independent $n\times n$ matrices of variables. Over every field of characteristic zero, every syntactically homogeneous $\Sigma\Pi\Sigma\Pi\Sigma$ circuit computing $\mathop{\mathrm{IMM}}\nolimits _{n,n}$ has at least $n^{\sqrt n/400}$ gates for all sufficiently large n , with an absolute threshold independent of the field. Bottom linear forms may have arbitrary support, and arbitrary finite fan-in, fan-out, and gate sharing are allowed. Over every field, a block expansion gives such circuits with…
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/Homogeneous-depth-five-lower-bounds-for-iterated-matrix-multiplication
curl -X POST /api/v1/records/openai-math/Homogeneous-depth-five-lower-bounds-for-iterated-matrix-multiplication/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Homogeneous-depth-five-lower-bounds-for-iterated-matrix-multiplication/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'