THE COMPLEXITY OF ELEMENTARY ALGEBRA AND GEOMETRY

被引：111

作者：

BENOR, M

KOZEN, D

REIF, J

机构：

[1] IBM CORP,RES,YORKTOWN HTS,NY

[2] HARVARD UNIV,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1016/0022-0000(86)90029-2

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：251 / 264

页数：14

共 15 条

[1] BERMAN L, 1980, THEOR COMPUT SCI, V11, P71, DOI 10.1016/0304-3975(80)90037-7
[2] BORODIN, 1982, 23RD P S F COMP SCI, P65
[3] RELATING TIME AND SPACE TO SIZE AND DEPTH
BORODIN, A
[J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 733 - 744
[4] EUCLIDS ALGORITHM AND THEORY OF SUBRESULTANTS
BROWN, WS
TRAUB, JF
[J]. JOURNAL OF THE ACM, 1971, 18 (04) : 505 - &
[5] COLLINS GE, 1975, LECT NOTES COMPUT SC, V35, P134
[6] Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040
[7] FISCHER MJ, 1974, P AMS S COMPLEXITY R, V7
[8] GATHEN JV, 1983, 15TH P ACM S THEOR C, P17
[9] JENKS R, 1976, P ACM S SYMBOLIC ALG
[10] Marden, 1996, GEOMETRY POLYNOMIALS