@inproceedings{Chattopadhyay_2021,
    doi = {10.1145/3406325.3451069},
    url = {https://doi.org/10.1145%2F3406325.3451069},
    year = {2021},
    month = {jun},
    publisher = {{ACM}},
    author = {Arkadev Chattopadhyay and Rajit Datta and Partha Mukhopadhyay},
    title = {Lower bounds for monotone arithmetic circuits via communication complexity},
    booktitle = {Proceedings of the 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing}
}

@inproceedings{Chattopadhyay_2021, doi = {10.1145/3406325.3451069}, url = {https://doi.org/10.1145%2F3406325.3451069}, year = {2021}, month = {jun}, publisher = {{ACM}}, author = {Arkadev Chattopadhyay and Rajit Datta and Partha Mukhopadhyay}, title = {Lower bounds for monotone arithmetic circuits via communication complexity}, booktitle = {Proceedings of the 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing} }