An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties

From MaRDI portal
Publication:1180414