Lower bounds for planar arithmetic circuits

DOI10.4230/LIPICS.ITCS.2024.91MaRDI QIDQ6906336zbMATH OpenFDO

Authors C. Ramya, Pratik Shastri

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

bilinear formsplanar circuitsarithmetic circuit complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Lower bounds for planar arithmetic circuits

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