An expected polynomial time algorithm for coloring 2-colorable 3-graphs

We present an algorithm that colors a random 2-colorable 3-uniform hypergraph optimally in expected running time O(n5log2n).