Login / Signup
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity.
Rahul Ilango
Hanlin Ren
Rahul Santhanam
Published in:
Electron. Colloquium Comput. Complex. (2021)
Keyphrases
</>
worst case
computational complexity
np hardness
decision problems
databases
information systems
random variables
machine learning
computational cost
probability distribution
phase transition
spatial distribution
complexity analysis