Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding lower bounds on the complexity of secret sharing schemes by linear programming |
scientific article |
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
