Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore hardness amplification techniques for real-valued functions in this 23-minute conference talk presented by Yunqi Li in collaboration with Prashant Nalini Vasudevan at the Fields Institute. Delve into the theoretical foundations and mathematical frameworks that extend traditional hardness amplification concepts from Boolean functions to the real-valued domain. Learn about the challenges and novel approaches required when working with continuous function spaces, including how amplification results translate across different computational models. Examine the implications of these techniques for complexity theory and their potential applications in cryptography and computational learning theory. Gain insights into cutting-edge research that bridges discrete and continuous computational paradigms, understanding how hardness properties can be systematically enhanced for functions operating over real numbers rather than binary inputs.
