Finding lower bounds on the complexity of secret sharing schemes by linear programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
Hi-index | 0.89 |