Pages that link to "Item:Q2851504"

The following pages link to An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504):

Displaying 4 items.

• Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
• An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
• The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)