Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. W. Adkins and S. Weintrab. Algebra, an approach via module theory. Springer-Verlag, NY, 1992.
2. A. Beimel, A. G’al, and M. Paterson. Lower bounds for monotone span programs. Computational Complexity, 6(1):29–45, 1997.
3. Lect Notes Comput Sci;S. Blackburn,1996
4. C. Blundo, A. De Santis, A.G. Gaggia, and U. Vaccaro. “New Bounds on the Information rate of Secret Sharing Schemes”. In IEEE Trans. on Inform. Theory, 41, no. 2, pp. 549–554, 1995.
5. C. Blundo, A. De Santis, R. De Simone,, and U. Vaccaro. “Tight Bounds on the Information rate of secret Sharing Schemes”. In Design, Codes and Cryptography, 11, pp. 107–122, 1997.