Round Optimal Concurrent Non-malleability from Polynomial Hardness.

Dakshita Khurana

Published in: TCC (2) (2017)

Keyphrases

worst case
np hard
optimal solution
dynamic programming
real time
optimal control
upper bound
information systems
artificial intelligence
data sets
information retrieval
machine learning
np complete
constraint satisfaction
database
optimal design
finding optimal