Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 24 of 74 found articles
 
 
  Finding lower bounds on the complexity of secret sharing schemes by linear programming
 
 
Title: Finding lower bounds on the complexity of secret sharing schemes by linear programming
Author: Padró, Carles
Vázquez, Leonor
Yang, An
Appeared in: Discrete applied mathematics
Paging: Volume 161 (2013) nr. 7-8 pages 13 p.
Year: 2013
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 24 of 74 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands