Pages that link to "Item:Q1949113"

The following pages link to Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113):

Displaying 10 items.

• Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
• On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
• Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
• Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
• Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem (Q2274088) (← links)
• Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
• Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
• How to share a secret (Q3050283) (← links)
• The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)