A new elementary proof and a coloring oracle achieve O(1) expected time per query on uniformly random 2-colorable k-uniform hypergraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Fast Coloring Oracle for Average Case Hypergraphs
A new elementary proof and a coloring oracle achieve O(1) expected time per query on uniformly random 2-colorable k-uniform hypergraphs.