ERC Consolidator Grant · 2025
Pushing Boundaries in BPL Derandomization
We propose to study one of the most fundamental problems in computational complexity theory: the BPL vs. L problem. Specifically, we aim to construct improved pseudorandom generators (PRGs) and weighted PRGs—a notion introduced by the PI and coauthors (STOC 18, CCC 21). In recent years, weighted PRGs have gained significant attention and played a central role in numerous advancements. Notably, the PI and coauthors leveraged WPRG techniques to improve the 30-year-old Saks-Zhou algorithm for iterated matrix multiplication (STOC 23). Despite a flurry of progress in recent years, achieving breakthroughs on such fundamental problems will likely require fresh and innovative approaches. In this…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.