New algorithms and lower bounds for circuits with linear threshold gates
Author:
Affiliation:
1. Stanford University
Funder
David Morgenthaler II Faculty Fellowship
Alfred P. Sloan Foundation
Microsoft Research
Division of Computing and Communication Foundations
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/2591796.2591858
Reference52 articles.
1. The expressive power of voting polynomials
2. On strong separations from AC0;Allender Eric;Fundamentals of Computation Theory,1991
3. When do extra majority gates help? Polylog (N) majority gates are equivalent to one
4. {BH12} Paul Beame and Trinh Huynh. Multiparty communication complexity and threshold circuit size of AC0. 41(3):484--518 2012. {BH12} Paul Beame and Trinh Huynh. Multiparty communication complexity and threshold circuit size of AC0. 41(3):484--518 2012.
5. Complex polynomials and circuit lower bounds for modular counting
Cited by 40 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization;SIAM Journal on Computing;2022-05-02
2. A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates;Algorithmica;2022-01-07
3. Upper Bound for Torus Polynomials;Computer Science – Theory and Applications;2021
4. Average-Case Rigidity Lower Bounds;Computer Science – Theory and Applications;2021
5. Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3