Lower bounds for monotone arithmetic circuits via communication complexity

DOI10.1145/3406325.3451069MaRDI QIDQ6087044zbMATH OpenOpenAlexFDO

Authors Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay

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

communication complexitylower boundsmonotone arithmetic circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Lower bounds for monotone counting circuits
• scientific article; zbMATH DE number 7204375 (Why is no real title available?)
• Monotone arithmetic complexity of graph homomorphism polynomials
• Monotone classes beyond VNP
• Monotone classes beyond VNP

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

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