RELATIONAL QUERIES COMPUTABLE IN POLYNOMIAL-TIME

被引：285

作者：

IMMERMAN, N

机构：

[1] Yale Univ, New Haven, CT, USA, Yale Univ, New Haven, CT, USA

来源：

INFORMATION AND CONTROL | 1986年 / 68卷 / 1-3期

关键词：

* Research fellowship;

D O I：

10.1016/S0019-9958(86)80029-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：86 / 104

页数：19

共 19 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Aho Alfred V., 1979, 6TH P ACM S PRINC PR, P110

[3]

[Anonymous], 1982, PRINCIPLES DATABASE

[4]

CHANDRA A, 1980, J COMPUT SYST SCI, V25, P99

[5]

Chandra A. K., 1981, P ACM S PRINC PROGR, P50

[6] COMPUTABLE QUERIES FOR RELATIONAL DATA-BASES [J].

CHANDRA, AK ;

HAREL, D .

[7]

Codd E.F., 1972, COURANT COMPUTER SCI, P65

[8]

DEROUGEMONT M, 1984, 16TH P ACM S THEOR C, P409

[9]

Enderton H. B., 2001, MATH INTRO LOGIC, V2nd ed

[10]

Fagin R., 1974, COMPLEXITY COMPUTATI, V7, P43