On Basing Size-Verifiable One-Way Functions on NP-Hardness.

Andrej Bogdanov Christina Brzuska

Published in: TCC (1) (2015)

Keyphrases

np hardness
np hard
approximation algorithms
worst case analysis
mixed integer
computationally efficient
special case
sufficient conditions
reinforcement learning
optimal solution
dynamic programming
sample size
linear program