CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project investigates the Bounded Probabilistic Logarithmic vs. Logarithmic problem in computational complexity theory. It aims to develop advanced pseudorandom generators and new computational models to enhance algorithmic efficiency and address longstanding challenges in the field.
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 itera…
TEL AVIV UNIVERSITY
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 topics.
Guests see up to 5 keywords.
