THE AVERAGE COMPLEXITY OF DEPTH-FIRST SEARCH WITH BACKTRACKING AND CUTOFF

被引：28

作者：

STONE, HS ^{[1
]}

SIPALA, P ^{[1
]}

机构：

[1] UNIV TRIESTE,DEPT ELECT ENGN,I-34127 TRIESTE,ITALY

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1986年 / 30卷 / 03期

关键词：

D O I：

10.1147/rd.303.0242

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：242 / 258

页数：17

共 11 条

[1]

Aho A.V., 1973, FIBONACCI QUART, V11, P429

[2] FUNCTION-THEORETIC APPROACH TO STUDY OF NONLINEAR RECURRING SEQUENCES [J].

FRANKLIN, JN ;

GOLOMB, SW .

PACIFIC JOURNAL OF MATHEMATICS, 1975, 56 (02) :455-468

[3]

GOTTLIEB A, 1982, COMPUTER, V15, P27, DOI 10.1109/MC.1982.1653824

[4]

GREENE DH, 1981, MATH ANAL ALGORITHMS

[5]

Harris TE., 1963, THEORY BRANCHING PRO

[6] SEARCHING FOR AN OPTIMAL PATH IN A TREE WITH RANDOM COSTS [J].

KARP, RM ;

PEARL, J .

ARTIFICIAL INTELLIGENCE, 1983, 21 (1-2) :99-116

[7]

KRUSKAL CP, 1983, IEEE T COMPUT, V32, P1091, DOI 10.1109/TC.1983.1676169

[8]

MULLIKIN TW, 1968, PROBABILISTIC METHOD

[9] PROGRAMMED ALGORITHMS TO COMPUTE TESTS TO DETECT AND DISTINGUISH BETWEEN FAILURES IN LOGIC CIRCUITS [J].

ROTH, JP ;

BOURICIUS, WG ;

SCHNEIDER, PR .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (05) :567-+

[10] RANDOM TREES AND THE ANALYSIS OF BRANCH AND BOUND PROCEDURES [J].

SMITH, DR .

JOURNAL OF THE ACM, 1984, 31 (01) :163-188

← 1 2 →