An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
scientific article; zbMATH DE number 6215197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
scientific article; zbMATH DE number 6215197 |
Statements
An expected polynomial time algorithm for coloring 2-colorable 3-graphs (English)
0 references
10 October 2013
0 references
coloring
0 references
hypergraphs
0 references
average case analysis
0 references
