Depth-𝑑 Threshold Circuits vs. Depth-(𝑑+1) AND-OR Trees-Reference-Cited by-同舟云学术

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

Depth-𝑑 Threshold Circuits vs. Depth-(𝑑+1) AND-OR Trees

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Hatami Pooya¹,Hoza William M.²,Tal Avishay³,Tell Roei⁴

Affiliation:

1. Ohio State University, USA

2. University of California at Berkeley, Berkeley, USA / Simons Institute for the Theory of Computing, Berkeley, USA

3. University of California at Berkeley, Berkeley, USA

4. Institute for Advanced Study, Princeton, USA / Rutgers University, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Link

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

Reference80 articles.

1. BQP and the polynomial hierarchy

2. A note on the power of threshold circuits

3. A Uniform Circuit Lower Bound for the Permanent

4. Depth Reduction for Circuits of Unbounded Fan-in

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP