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

Carles Padró Leonor Vázquez An Yang

Published in: IACR Cryptol. ePrint Arch. (2012)

Keyphrases

linear programming
lower bound
secret sharing scheme
upper bound
np hard
objective function
optimal solution
secret sharing
high quality
data structure
low cost
linear program
computational complexity
dynamic programming
hough transform