Three lectures on real computation

被引：0

作者：

Cucker, F ^{[1
]}

机构：

[1] City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China

来源：

ASPECTS OF COMPLEXITY: MINICOURSES IN ALGORITHMICS, COMPLEXITY AND COMPUTATIONAL ALGEBRA | 2001年 / 4卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In the following series of lectures, I will discuss the main issues associated with the theory of computability and of complexity for models of computation where reals are treated as basic objects.

引用

页码：29 / 50

页数：22

共 24 条

[1]

Allender E, 2001, DEGRUYTER SER LOG AP, V4, P1

[2]

BALCAZAR JL, 1990, MONOGR THEORET COMPU, V22

[3]

BALCAZAR JL, 1988, MONOGR THEORET COMPU, V11

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

[5] ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS - NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES [J].

BLUM, L ;

SHUB, M ;

SMALE, S .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1989, 21 (01) :1-46

[6]

Blum L., 1998, Complexity and Real Computation

[7]

Cucker F., 1992, Journal of Complexity, V8, P230, DOI 10.1016/0885-064X(92)90024-6

[8] Complexity estimates depending on condition and round-off error [J].

Cucker, F ;

Smale, S .

JOURNAL OF THE ACM, 1999, 46 (01) :113-184

[9]

CUCKER F, 2001, PRIMAL DUAL ALGORITH

[10]

Demmel J.W., 1997, APPL NUMERICAL LINEA

← 1 2 3 →