Pages that link to "Item:Q2854182"

The following pages link to Perfect secret sharing schemes for graph access structures on six participants (Q2854182):

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)
• 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)
• On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
• Average complexities of access structures on five participants (Q2391417) (← links)
• Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
• Secret sharing on regular bipartite access structures (Q2701503) (← links)
• An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem (Q3174872) (← links)
• Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
• The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)