default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear ..."

Carles Padró, Leonor Vázquez (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-12200-2_31

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/PadroV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/PadroV10
Carles Padró, Leonor Vázquez:
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. LATIN 2010: 344-355

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.