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

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.91

zbMATH Keywords

arithmetic circuit complexitybilinear formsplanar circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Lower Bound for the Formula Size of Rational Functions
• A Separator Theorem for Planar Graphs
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Elusive functions and lower bounds for arithmetic circuits
• scientific article; zbMATH DE number 3566171 (Why is no real title available?)
• scientific article; zbMATH DE number 3597878 (Why is no real title available?)
• scientific article; zbMATH DE number 1256744 (Why is no real title available?)
• scientific article; zbMATH DE number 1263251 (Why is no real title available?)
• scientific article; zbMATH DE number 1346515 (Why is no real title available?)
• Lower bounds to the complexity of symmetric Boolean functions
• Meanders and their applications in lower bounds arguments
• On the complexity of matrix product
• On the complexity of planar Boolean circuits
• On the degree of Boolean functions as real polynomials
• Partial derivatives in arithmetic complexity and beyond
• Quadratic lower bounds for algebraic branching programs and formulas
• The complexity of partial derivatives
• The performance of multilective VLSI algorithms

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)