Lower bounds for monotone arithmetic circuits via communication complexity-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Lower bounds for monotone arithmetic circuits via communication complexity

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Chattopadhyay Arkadev¹,Datta Rajit²,Mukhopadhyay Partha²

Affiliation:

1. Tata Institute of Fundamental Research, India

2. Chennai Mathematical Institute, India

Funder

MATRICS grant of the Science and Engineering Research Board, DST, India

Infosys Foundation

Tata Consultancy Services Research Fellowship

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451069

Reference36 articles.

1. The NOF Multiparty Communication Complexity of Composed Functions

2. Arithmetic Circuits: A Chasm at Depth Four

3. Monotone versus positive

4. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

5. Estimates for the Number of Sums and Products and for Exponential Sums in Fields of Prime Order;Bourgain J.;Journal of London Mathematical Society,2006

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monotone Arithmetic Complexity of Graph Homomorphism Polynomials;Algorithmica;2023-03-11

2. Theory research in India;Communications of the ACM;2022-10-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP