Method of determining lower bounds for the complexity of P-schemes-Reference-Cited by-同舟云学术

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

Method of determining lower bounds for the complexity of P-schemes

Published:1971-07 Issue:1 Volume:10 Page:474-479
ISSN:0001-4346
Container-title:Mathematical Notes of the Academy of Sciences of the USSR
language:en
Short-container-title:Mathematical Notes of the Academy of Sciences of the USSR

Author:

Khrapchenko V. M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01747074.pdf

Reference2 articles.

1. V. M. Khrapchenko, “The complexity of realizing linear functions in the class of P-schemes,” Matem. Zametki,9, No. 1, 35–40 (1970).

2. B. M. Kloss, “Estimates of the complexity of solutions of systems of linear equations,” Dokl. Akad. Nauk SSSR,171, No.4, 731–783 (1966).

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

1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12

2. Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. 3.1 n − o ( n ) circuit lower bounds for explicit functions;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Regular expression length via arithmetic formula complexity;Journal of Computer and System Sciences;2022-05

5. Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP