MONTE-CARLO APPROXIMATION ALGORITHMS FOR ENUMERATION PROBLEMS

被引：183

作者：

KARP, RM

LUBY, M

MADRAS, N

机构：

[1] UNIV CALIF BERKELEY,DIV COMP SCI,BERKELEY,CA 94720

[2] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A4,ONTARIO,CANADA

[3] YORK UNIV,DEPT MATH,YORK,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1016/0196-6774(89)90038-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：429 / 448

页数：20

共 9 条

[1]

Ajtai M., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P11, DOI 10.1109/SFCS.1985.19

[2]

enyi A. R, 1970, PROBABILITY THEORY

[3]

Karp R. M., 1985, Journal of Complexity, V1, P45, DOI 10.1016/0885-064X(85)90021-4

[4]

Karp R. M., 1983, 24th Annual Symposium on Foundations of Computer Science, P56, DOI 10.1109/SFCS.1983.35

[5]

LUBY MG, 1983, THESIS U CALIFORNIA

[6]

LUBY MG, 1983, UCBCSD84168 U CAL CO

[7]

MADRAS N, 1987, HIGHLY EFFICIENT MON

[8]

PROVAN JS, 1981, COMPLEXITY COUNTING

[9] COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMS [J].

VALIANT, LG .