Secret-sharing schemes for very dense graphs (Q290386)
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: Secret-sharing schemes for very dense graphs |
scientific article; zbMATH DE number 6588390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secret-sharing schemes for very dense graphs |
scientific article; zbMATH DE number 6588390 |
Statements
Secret-sharing schemes for very dense graphs (English)
0 references
1 June 2016
0 references
secret-sharing
0 references
share size
0 references
graph access structures
0 references
complete bipartite covers
0 references
equivalence covers
0 references
0 references
0 references
0 references
0 references
0.9938846230506896
0 references
0.9187030792236328
0 references
0.915662407875061
0 references
0.8856488466262817
0 references
0.8523176312446594
0 references
