On the advice complexity of coloring bipartite graphs and two-colorable hypergraphs (Q4584661)
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: On the advice complexity of coloring bipartite graphs and two-colorable hypergraphs |
scientific article; zbMATH DE number 6931405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the advice complexity of coloring bipartite graphs and two-colorable hypergraphs |
scientific article; zbMATH DE number 6931405 |
Statements
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs (English)
0 references
3 September 2018
0 references
coloring bipartite graphs
0 references
0.9442306756973268
0 references
0.9436438083648682
0 references
0.8837845921516418
0 references
0.8631954193115234
0 references
0.8541030883789062
0 references
