Computing roadmaps of semi-algebraic sets on a variety

被引：51

作者：

Basu, S ^{[1
]}

Pollack, R

Roy, MF

机构：

[1] Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA

[2] NYU, Courant Inst Math Sci, New York, NY 10012 USA

[3] Univ Rennes, IRMAR, CNRS, URA 305, F-35042 Rennes, France

来源：

JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY | 2000年 / 13卷 / 01期

关键词：

roadmaps; semi-algebraic sets; variety;

D O I：

10.1090/S0894-0347-99-00311-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：55 / 82

页数：28

共 23 条

[1]

[Anonymous], KLUWER INT SERIES EN

[2]

[Anonymous], 1998, ERGEBNISSE MATH IHRE

[3] On the combinatorial and algebraic complexity of quantifier elimination [J].

Basu, S ;

Pollack, R ;

Roy, MF .

JOURNAL OF THE ACM, 1996, 43 (06) :1002-1045

[4]

Basu S., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P168, DOI 10.1145/237814.237857

[5] On computing a sei of points meeting every cell defined by a family of polynomials on a variety [J].

Basu, S ;

Pollack, R ;

Roy, MF .

JOURNAL OF COMPLEXITY, 1997, 13 (01) :28-37

[6]

BASU S, 1997, COMPUTING ROADMAPS S, P1

[7]

Canny J., 1992, Applicable Algebra in Engineering, Communication and Computing, V2, P217, DOI 10.1007/BF01614146

[8] COMPUTING ROADMAPS OF GENERAL SEMI-ALGEBRAIC SETS [J].

CANNY, J .

COMPUTER JOURNAL, 1993, 36 (05) :504-514

[9]

CANNY J, 1987, COMPLEXITY ROBOT MOT

[10] 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

← 1 2 3 →