"Finding lower bounds on the complexity of secret sharing schemes by linear ..."

Carles Padró, Leonor Vázquez, An Yang (2013)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2012.10.020

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/PadroVY13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/PadroVY13
Carles Padró, Leonor Vázquez, An Yang:
Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discret. Appl. Math. 161(7-8): 1072-1084 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.