Corrigendum addresses findings on lower bounds for planar arithmetic circuits, suggesting relevant implications for complexity theory.
This is a corrigendum for the article "Lower Bounds for Planar Arithmetic Circuits" published in ACM Trans. Comput. Theory 18, 1, Article 9 (February 2026), 23 pages.
No takes yet. Share an insight, caveat, or question.
Ramya et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: