Lower Bounds on Structure-Preserving Signatures for Bilateral Messages.
Masayuki AbeMiguel AmbronaMiyako OhkuboMehdi TibouchiPublished in: SCN (2018)
Keyphrases
- structure preserving
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- signature verification
- dimensionality reduction
- worst case
- vc dimension
- signature recognition
- upper and lower bounds
- objective function
- randomly generated problems
- sample complexity
- optimal solution
- text messages
- lower bounding
- multi issue
- electronic mail
- online discussion
- online algorithms
- max sat
- neural network
- theoretical analysis
- computer vision