Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hershko, Tal"'
Autor:
Hershko, Tal, Zhukovskii, Maksim
We study the problem of distinguishing between two independent samples $\mathbf{G}_n^1,\mathbf{G}_n^2$ of a binomial random graph $G(n,p)$ by first order (FO) sentences. Shelah and Spencer proved that, for a constant $\alpha\in(0,1)$, $G(n,n^{-\alpha
Externí odkaz:
http://arxiv.org/abs/2405.09146
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2012 Mar . 109(12), 4621-4626.
Externí odkaz:
https://www.jstor.org/stable/41585542
