Sciweavers

Share
DMTCS
2011
261views Mathematics» more  DMTCS 2011»
9 years 11 months ago
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht
Mathematics
Top of PageReset Settings
books