Pages that link to "Item:Q1943986"

The following pages link to The complexity of the graph access structures on six participants (Q1943986):

Displaying 8 items.

• The complexity of the connected graph access structure on seven participants (Q515397) (← links)
• A generalized information theoretical model for quantum secret sharing (Q517681) (← 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)
• Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
• An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem (Q3174872) (← links)
• The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)