Lower bounds for monotone arithmetic circuits via communication complexity

DOI10.1145/3406325.3451069OpenAlexW3170515206MaRDI QIDQ6087044

Rajit Datta, Partha Mukhopadhyay, Arkadev Chattopadhyay

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451069

zbMATH Keywords

lower boundscommunication complexitymonotone arithmetic circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Monotone arithmetic complexity of graph homomorphism polynomials

This page was built for publication: Lower bounds for monotone arithmetic circuits via communication complexity