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]
@article{PadroVY13,
title = {Finding lower bounds on the complexity of secret sharing schemes by linear programming},
author = {Carles Padró and Leonor Vázquez and an Yang},
year = {2013},
doi = {10.1016/j.dam.2012.10.020},
url = {http://dx.doi.org/10.1016/j.dam.2012.10.020},
researchr = {https://researchr.org/publication/PadroVY13},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {161},
number = {7-8},
pages = {1072-1084},
}