Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032)
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: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming |
scientific article; zbMATH DE number 5702164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming |
scientific article; zbMATH DE number 5702164 |
Statements
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (English)
0 references
27 April 2010
0 references
secret sharing
0 references
optimization of secret sharing schemes for general access structures
0 references
1.0000001
0 references
0.9600073
0 references
0.9600073
0 references
0.9177764
0 references
0.91265607
0 references
0.90295845
0 references
0.9020245
0 references
0.9005606
0 references
0.89948034
0 references
