Feasible arithmetic computations: Valiant's hypothesis-Reference-Cited by-同舟云学术

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

Feasible arithmetic computations: Valiant's hypothesis

Published:1987-10 Issue:2 Volume:4 Page:137-172
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

von zur Gathen Joachim

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference57 articles.

1. The complexity of partial derivatives;Baur;Theor. Camp. SoL,1982

2. On computing the determinant in small parallel time using a small number of processors;Berkowitz;Inf. Pro. Left,1984

3. Mémoire sur un système de formules analytiques, et leur application à des considérations géométriques;Binet;Z Ecole polytechnique,1813

4. An introduction to multilinear algebra and some applications;Blokhuis;Philips J. Res,1984

5. Structured vs;Borodin;general models in computational complexity. In: Logic and Algorithmic, Symposium in honour of Ernst Specker. Enseign. Math,,1982

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

1. On hard instances of non-commutative permanent;Discrete Applied Mathematics;2020-04

2. CATEGORICAL COMPLEXITY;Forum of Mathematics, Sigma;2020

3. Circuit Complexity, Proof Complexity, and Polynomial Identity Testing;Journal of the ACM;2018-12-31

4. Lower Bounds for the Circuit Size of Partially Homogeneous Polynomials;Journal of Mathematical Sciences;2017-07-28

5. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory;Theory of Computing Systems;2017-03-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP