Year: 2026
Type: conference-paper
Abstract: Consider a function that is mildly hard for size-\(s\) circuits. For sufficiently large \(s\), Impagliazzo’s hardcore lemma provides a subset of inputs on which the same function is extremely hard for circuits of size \(s' \ll s\). Blanc, Hayderi, Koch, and Tan [FOCS, 2024] proved that the size degradation from \(s\) to \(s'\) present in this lemma is quantitatively tight. We give a much simpler proof of this fact by showing that the hardcore lemma is tight for a random junta with high probability.
Author: Vinayak M. Kumar
Institution: The University of Texas at Austin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7119216670
