Algebraic methods in the theory of lower bounds for Boolean circuit complexity-Reference-Cited by-同舟云学术

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

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

Published:1987 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
language:
Short-container-title:

Author:

Smolensky R.

Publisher

ACM Press

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

1. Localizability of the approximation method;computational complexity;2024-09-05

2. Constant Depth Circuit Complexity for Generating Quasigroups;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

3. Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Lower Bounds for Regular Resolution over Parities;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP