The following pages link to Adhesivity of polymatroids (Q2455572):
Displayed 4 items.
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)