We present a new generic transformation from weak PRFs computable in depth $d(n) = \Omega(\log n)$ to strong PRFs computable in depth $O(d(n))$. This construction refines the classical tree-based paradigm of GGM by {tapering} the internal state so the per-level depth decreases geometrically. We complement the above wit...
Youlong Ding, Aayush Jain, Ilan Komargodski· 0 citations
We consider the following problems: Given two $n \times n$ tables defining binary operations $+$ and $\cdot$ on a set $S$ of $n$ elements, decide whether $(S,+,\cdot)$ forms a ring or, respectively, a field. Recently, Dudek, Fischer, Gokaj, Jin, K\"unnemann, Mao, and Redzic (STOC 2026) obtained the following two (near-...
Youlong Ding· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.