Finding lower bounds on the complexity of secret sharing schemes by linear programming

Carles Padró, Leonor Vázquez, an Yang. Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discrete Applied Mathematics, 161(7-8):1072-1084, 2013. [doi]

Authors

Carles Padró

This author has not been identified. Look up 'Carles Padró' in Google

Leonor Vázquez

This author has not been identified. Look up 'Leonor Vázquez' in Google

an Yang

This author has not been identified. Look up 'an Yang' in Google