How complex are random graphs in first order logic?
- 作者Jeong Han Kim; Oleg Pikhurko; Joel H. Spencer; Oleg Verbitsky
- 卷第26卷
- 印刷ISSN1042-9832
- 电子ISSN1098-2418
- 文件大小260.84KB
- 发表时间2005
- DOI10.1002/rsa.20049
- 页码119-145
同作者推荐
Distances and Finger Search in Random Binary Search TreesDevroye, Luc; Neininger, Ralph · SIAM Journal on Computing · 2004
Density Approximation and Exact Simulation of Random Variables That Are Solutions of Fixed-Point EquationsLuc Devroye and Ralph Neininger · Advances in Applied Probability · 2002
Density approximation and exact simulation of random variables that are solutions of fixed-point equationsDevroye, Luc; Neininger, Ralph · Advances in Applied Probability · 2002