PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS

被引：38

作者：

ULLMAN, JD

VANGELDER, A

机构：

来源：

关键词：

D O I：

10.1007/BF01762108

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：5 / 42

页数：38

共 24 条

[1]

AFRATI F, 1987, 6TH P ACM S PODS, P210

[2]

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

[3] CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMING [J].

APT, KR ;

VANEMDEN, MH .

[4]

Atallah M. J., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P222, DOI 10.1109/SFCS.1985.53

[5] STRUCTURE AND COMPLEXITY OF RELATIONAL QUERIES [J].

CHANDRA, A ;

HAREL, D .

[6] OBSERVATION ON TIME-STORAGE TRADE OFF [J].

COOK, SA .

[7] A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J].

COOK, SA .

INFORMATION AND CONTROL, 1985, 64 (1-3) :2-22

[8]

COSMADAKIS SS, 1986, 5TH P ACM S PRINC DA, P280

[9]

Ginsburg S., 1966, SIAM J CONTROL, V4, P429, DOI [10.1137/0304034, DOI 10.1137/0304034]

[10]

Greibach S., 1968, Mathematical Systems Theory, V2, P1, DOI 10.1007/BF01691341