SOME RESULTS CONCERNING THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION

被引：0

|

作者：

BYLANDER, T

ALLEMANG, D

TANNER, MC

JOSEPHSON, JR

机构：

来源：

PROCEEDINGS OF THE FIRST CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING | 1989年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

下载

收藏

页码：44 / 54

页数：11

相关论文

共 50 条

[21] ON THE COMPUTATIONAL-COMPLEXITY OF CONTINUOUS ROUTING
CHANG, YK
HAMBRUSCH, S
SIMON, J
JOURNAL OF ALGORITHMS, 1989, 10 (01) : 86 - 108
[22] CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS
STOCKMEYER, L
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 1 - 43
[23] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
[24] DESCRIPTIVE CHARACTERIZATIONS OF COMPUTATIONAL-COMPLEXITY
LEIVANT, D
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (01) : 51 - 83
[25] ON THE COMPUTATIONAL-COMPLEXITY OF MODULAR SYMBOLS
GOLDFELD, D
MATHEMATICS OF COMPUTATION, 1992, 58 (198) : 807 - 814
[26] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 199 - 233
[27] COMPUTATIONAL-COMPLEXITY ON NUMERICAL INTEGRALS
WANG, XH
HAN, DF
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES, 1991, 34 (01): : 42 - 47
[28] THE COMPUTATIONAL-COMPLEXITY OF UNIVERSAL HASHING
MANSOUR, Y
NISAN, N
TIWARI, P
THEORETICAL COMPUTER SCIENCE, 1993, 107 (01) : 121 - 133
[29] COMPUTATIONAL-COMPLEXITY OF REAL FUNCTIONS
KO, KI
FRIEDMAN, H
THEORETICAL COMPUTER SCIENCE, 1982, 20 (03) : 323 - 352
[30] ESTIMATION OF THE GRADIENT COMPUTATIONAL-COMPLEXITY
KIM, KV
NESTEROV, IE
CHERKASSKII, BV
DOKLADY AKADEMII NAUK SSSR, 1984, 275 (06): : 1306 - 1309

← 1 2 3 4 5 →