THE COMPLEXITY OF SOME POLYNOMIAL NETWORK CONSISTENCY ALGORITHMS FOR CONSTRAINT SATISFACTION PROBLEMS

被引：269

作者：

MACKWORTH, AK ^{[1
]}

FREUDER, EC ^{[1
]}

机构：

[1] UNIV NEW HAMPSHIRE,DEPT COMP SCI,DURHAM,NH 03824

来源：

ARTIFICIAL INTELLIGENCE | 1985年 / 25卷 / 01期

关键词：

D O I：

10.1016/0004-3702(85)90041-4

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

收藏

页码：65 / 74

页数：10

相关论文

共 5 条

[1] ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION
COPPERSMITH, D
WINOGRAD, S
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 472 - 492
[2] A SUFFICIENT CONDITION FOR BACKTRACK-FREE SEARCH
FREUDER, EC
[J]. JOURNAL OF THE ACM, 1982, 29 (01) : 24 - 32
[3] SYNTHESIZING CONSTRAINT EXPRESSIONS
FREUDER, EC
[J]. COMMUNICATIONS OF THE ACM, 1978, 21 (11) : 958 - 966
[4] GASCHNIG J, 1979, CMUCS79124 CARN MELL
[5] INCREASING TREE-SEARCH EFFICIENCY FOR CONSTRAINT SATISFACTION PROBLEMS
HARALICK, RM
ELLIOTT, GL
[J]. ARTIFICIAL INTELLIGENCE, 1980, 14 (03) : 263 - 313