A subexponential construction of graph coloring for multiparty computation (Q490341)
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: A subexponential construction of graph coloring for multiparty computation |
scientific article; zbMATH DE number 6389266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subexponential construction of graph coloring for multiparty computation |
scientific article; zbMATH DE number 6389266 |
Statements
A subexponential construction of graph coloring for multiparty computation (English)
0 references
22 January 2015
0 references
multiparty computation
0 references
graph coloring
0 references
non-abelian group
0 references
planar graph
0 references
0.8767162561416626
0 references
0.8300507664680481
0 references
0.8138043880462646
0 references
0.7848873138427734
0 references
0.7744043469429016
0 references
