COMPLEXITY OF COMPUTATION ON REAL ALGEBRAIC-NUMBERS

被引：25

作者：

ROY, MF ^{[1
]}

SZPIRGLAS, A ^{[1
]}

机构：

[1] UNIV PARIS 13,CTR SCI & POLYTECH,F-93430 VILLETANEUSE,FRANCE

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1990年 / 10卷 / 01期

关键词：

D O I：

10.1016/S0747-7171(08)80035-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper is devoted to a precise algorithmical and complexity study of a new polynomial time method for formal computations with polynomial inequalities and real algebraic numbers. © 1990, Academic Press Limited. All rights reserved.

引用

页码：39 / 51

页数：13

共 12 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] THE COMPLEXITY OF ELEMENTARY ALGEBRA AND GEOMETRY [J].

BENOR, M ;

KOZEN, D ;

REIF, J .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 32 (02) :251-264

[3]

BOCHNAK J., 1987, ERGEB MATH GRENZGEB, V12

[4]

Collins G. E., 1975, LECT NOTES COMPUT SC, V33, P134, DOI [DOI 10.1007/3-540-07407-4_17, 10.1007/3-540-07407-4_17]

[5]

Computation Maurice, 1982, COMPUTER ALGEBRA SYM

[6] THOMS LEMMA, THE CODING OF REAL ALGEBRAIC-NUMBERS AND THE COMPUTATION OF THE TOPOLOGY OF SEMI-ALGEBRAIC SETS [J].

COSTE, M ;

ROY, MF .

JOURNAL OF SYMBOLIC COMPUTATION, 1988, 5 (1-2) :121-129

[7]

CUCKER F, 1989, SPRINGER LECTURE NOT, V356

[8]

Jacobson N., 1974, BASIC ALGEBRA

[9]

Lang S., 1965, ALGEBRA

[10]

ROY MF, 1990, IN PRESS COMPUTATION

← 1 2 →