Explore a thought-provoking conference talk delving into the intricate relationship between one-way functions and Kolmogorov complexity. Join speakers Yanyi Liu from Cornell and Rafael Pass from Cornell Tech as they present their insights and findings on this fascinating topic in theoretical computer science. Gain a deeper understanding of the fundamental concepts and their implications in cryptography and computational complexity theory during this 23-minute IEEE presentation.
Overview
Syllabus
On One-way Functions and Kolmogorov Complexity
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Cryptography and Kolmogorov Complexity - A Quick Tutorial
-
Capturing One-Way Functions via NP-Hardness of Meta-Complexity
-
Complexity Theory Through the Lens of Kolmogorov Complexity - Tutorial 2
-
One-Way Computable Transformations - The Barmalias-Zhang Example
-
Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions
-
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions
