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

Andrej Bogdanov Christina Brzuska

Published in: Electron. Colloquium Comput. Complex. (2014)

Keyphrases

np hardness
np hard
approximation algorithms
mixed integer
computational complexity
worst case analysis
sufficient conditions
discrete tomography
search algorithm
dynamic programming
probability distribution
scheduling problem
multi dimensional
dynamic environments
multistage