Login / Signup
Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs.
Aryeh Grinberg
Ronen Shaltiel
Emanuele Viola
Published in:
Electron. Colloquium Comput. Complex. (2018)
Keyphrases
</>
lower bound
upper bound
np hard
worst case
objective function
learning algorithm
branch and bound
theorem proving
optimal solution
computational complexity
phase transition
learning theory
online algorithms
quadratic assignment problem