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 条

[31] COMPUTATIONAL-COMPLEXITY .5.
KELLY, JS
SOCIAL CHOICE AND WELFARE, 1988, 5 (04) : 313 - 317
[32] ON THE COMPUTATIONAL-COMPLEXITY OF THE ORDER POLYNOMIAL
FAIGLE, U
SCHRADER, R
DISCRETE APPLIED MATHEMATICS, 1986, 15 (2-3) : 261 - 269
[33] ON THE COMPUTATIONAL-COMPLEXITY OF CODES IN GRAPHS
KRATOCHVIL, J
KRIVANEK, M
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 396 - 404
[34] THE COMPUTATIONAL-COMPLEXITY OF CELLULAR AUTOMATA
SUTNER, K
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 451 - 459
[35] COMPUTATIONAL-COMPLEXITY OF SPLINE INTERPOLATION
TORAICHI, K
KATAGISHI, K
SEKITA, I
MORI, R
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1987, 18 (05) : 945 - 954
[36] THE COMPUTATIONAL-COMPLEXITY OF MAXIMIZATION AND INTEGRATION
FRIEDMAN, H
ADVANCES IN MATHEMATICS, 1984, 53 (01) : 80 - 98
[37] COMPUTATIONAL-COMPLEXITY OF SOME MAXIMUM AVERAGE WEIGHT PROBLEMS WITH PRECEDENCE CONSTRAINTS
FAIGLE, U
KERN, W
OPERATIONS RESEARCH, 1994, 42 (04) : 688 - 693
[38] COMPUTATIONAL-COMPLEXITY OF SOME PROBLEMS IN PARAMETRIC DISCRETE PROGRAMMING .1.
BLAIR, CE
JEROSLOW, RG
MATHEMATICS OF OPERATIONS RESEARCH, 1986, 11 (02) : 241 - 260
[39] COMPUTATIONAL-COMPLEXITY OF OPTIMUM MULTIUSER DETECTION
VERDU, S
ALGORITHMICA, 1989, 4 (03) : 303 - 312
[40] ON THE COMPUTATIONAL-COMPLEXITY OF PATH COVER PROBLEMS
NTAFOS, S
GONZALEZ, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (02) : 225 - 242

← 1 2 3 4 5 →