Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113)
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 6157669
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding lower bounds on the complexity of secret sharing schemes by linear programming |
scientific article; zbMATH DE number 6157669 |
Statements
Finding lower bounds on the complexity of secret sharing schemes by linear programming (English)
0 references
25 April 2013
0 references
secret sharing
0 references
linear programming
0 references
polymatroid
0 references
non-Shannon information inequalities
0 references
0 references
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
