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
关键词
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
相关论文
共 50 条