A Fast Coloring Oracle for Average Case Hypergraphs

Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld +2

Hypergraph $2$-colorability is one of the classical NP-hard problems. Person and Schacht [SODA'09] designed a deterministic algorithm whose expected running time is polynomial over…