NOTE ON COMPLEXITY OF ALGEBRAIC DIFFERENTIATION

被引：2

|

作者：

CAVINESS, BF

EPSTEIN, HI

机构：

来源：

INFORMATION PROCESSING LETTERS | 1978年 / 7卷 / 02期

关键词：

D O I：

10.1016/0020-0190(78)90057-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：122 / 124

页数：3

相关论文

共 50 条

[41] A NOTE ON ODOR COMPLEXITY
JELLINEK, JS
[J]. CHEMICAL SENSES, 1990, 15 (04) : 491 - 493
[42] NOTE ON THE COMPLEXITY OF CRYPTOGRAPHY
BRASSARD, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (02) : 232 - 233
[43] COMPLEXITY IN IDEALS OF POLYNOMIALS: QUESTIONS ON ALGEBRAIC COMPLEXITY OF CIRCUITS AND PROOFS
Arvind, V
[J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2020, 2020 (130): : 13 - 36
[44] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
Forbes, Michael A.
Shpilka, Amir
Tzameret, Iddo
Wigderson, Avi
[J]. THEORY OF COMPUTING, 2021, 17
[45] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
Forbes, Michael A.
Shpilka, Amir
Tzameret, Iddo
Wigderson, Avi
[J]. 31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
[46] On the Complexity of the Differential-Algebraic Description of Analytic Complexity Classes
Beloshapka, V. K.
[J]. MATHEMATICAL NOTES, 2019, 105 (3-4) : 309 - 315
[47] On the Complexity of the Differential-Algebraic Description of Analytic Complexity Classes
V. K. Beloshapka
[J]. Mathematical Notes, 2019, 105 : 309 - 315
[48] COMPLEXITY IN IDEALS OF POLYNOMIALS: QUESTIONS ON ALGEBRAIC COMPLEXITY OF CIRCUITS AND PROOFS
Grochow, Joshua A.
[J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2020, (131):
[49] Complexity Classes and Completeness in Algebraic Geometry
M. Umut Isik
[J]. Foundations of Computational Mathematics, 2019, 19 : 245 - 258
[50] Expressive power and complexity in algebraic logic
Hirsch, R
[J]. JOURNAL OF LOGIC AND COMPUTATION, 1997, 7 (03) : 309 - 351

← 1 2 3 4 5 →