One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions.
Yanyi LiuRafael PassPublished in: CRYPTO (2) (2023)
Keyphrases
- kolmogorov complexity
- inductive inference
- probability functions
- probability distribution
- parametric family
- information theoretic
- bayesian networks
- continuous functions
- generative model
- probabilistic model
- mixture distributions
- np complete
- complexity measures
- machine learning
- learning theory
- joint distribution
- computational complexity