Login / Signup
Cryptographic hardness under projections for time-bounded Kolmogorov complexity.
Eric Allender
John Gouwar
Shuichi Hirahara
Caleb Robelle
Published in:
Theor. Comput. Sci. (2023)
Keyphrases
</>
kolmogorov complexity
inductive inference
smart card
complexity measures
three dimensional
tomographic reconstruction
key management
computational complexity
radon transform
np complete
learning theory
hash functions
worst case
np hard
neural network
loss function
security protocols
bounded treewidth