Pages that link to "Item:Q717150"
From MaRDI portal
The following pages link to Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150):
Displayed 7 items.
- Complexity of universal access structures (Q413265) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)