Pages that link to "Item:Q1609153"

The following pages link to Weighted decomposition construction for perfect secret sharing schemes (Q1609153):

Displaying 11 items.

• The complexity of the connected graph access structure on seven participants (Q515397) (← links)
• Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
• Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
• Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
• The complexity of the graph access structures on six participants (Q1943986) (← links)
• Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
• On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← links)
• Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
• On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
• Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
• Secret sharing on regular bipartite access structures (Q2701503) (← links)