RANDOM GENERATION OF COMBINATORIAL STRUCTURES FROM A UNIFORM-DISTRIBUTION

被引：593

作者：

JERRUM, MR

VALIANT, LG

VAZIRANI, VV

机构：

[1] HARVARD UNIV,AIKEN COMPUTAT LAB,CAMBRIDGE,MA 02138

[2] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

关键词：

D O I：

10.1016/0304-3975(86)90174-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：169 / 188

页数：20

共 16 条

[1]

BACH E, 1983, 15TH P ANN ACM S THE, P184

[2] THE RANDOM SELECTION OF UNLABELED GRAPHS [J].

DIXON, JD ;

WILF, HS .

[3]

Erdos P., 1974, PROBABILISTIC METHOD

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[6]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[7]

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

[8]

SCHNORR CP, 1976, 3RD P INT C AUT LANG, P322

[9]

SIMON J, 1977, 4TH P INT COLL AUT L, P480

[10]

Sipser M., 1983, P 15 ANN ACM S THEOR, P330