Padró Laimon, C., Vázquez González, L., & Yang, A. (2013). Finding lower bounds on the complexity of secret sharing schemes by linear programming.
Citación estilo ChicagoPadró Laimon, Carles|||0000-0002-8644-5929, Leonor Vázquez González, y An Yang. Finding Lower Bounds On the Complexity of Secret Sharing Schemes By Linear Programming. 2013.
Cita MLAPadró Laimon, Carles|||0000-0002-8644-5929, Leonor Vázquez González, y An Yang. Finding Lower Bounds On the Complexity of Secret Sharing Schemes By Linear Programming. 2013.
Precaución: Estas citas no son 100% exactas.