We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph $H_{n,p;k}$, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs $H_{n,r;k},r=O(1)$.

中文翻译：

---

随机k-一致超图的同构

我们研究随机超图的同构问题。我们证明对于二项式随机k-一致超图它在多项式时间内是可解的$H_{ñ，p;ķ}$，适用于广泛的p。我们还表明对于随机r-正则，k-统一超图它是可解决的$H_{ñ，\mathrm{[R};ķ}，\mathrm{[R}=Ø（\mathrm{1个}）$。