Pages that link to "Item:Q3557032"
From MaRDI portal
The following pages link to Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032):
Displayed 5 items.
- The complexity of the connected graph access structure on seven participants (Q515397) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)