Yang Hu

Mr. Yang Hu

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
YHYang Hu
Yang Hu
WKWilliam Kuszmaul
William Kuszmaul
JLJingxun Liang
Jingxun Liang
HYHuacheng Yu
Huacheng Yu
JZJunkai Zhang
Junkai Zhang
RZRenfei Zhou
Renfei Zhou
In the static retrieval problem, a data structure must answer retrieval queries mapping a set of $n$ keys in a universe $[U]$ to $v$-bit values. Information-theoretically, retrieval data structures can use as little as $nv$ bits of space. For small value sizes $v$, it is possible to achieve $O(1)$ query time while using space $nv + o(n)$ bits -- whether or not such a result is possible for larger values of $v$ (e.g., $v = Θ(\log n)$) has remained open. In this paper, we obtain a tight lower bound (as well as matching upper bounds) for the static retrieval problem. In the case where values are large, we show that there is actually a significant tension between time and space. It is not possible, for example, to get $O(1)$ query time using $nv + o(n)$ bits of space, when $v = Θ(\log n)$ (and assuming the word RAM model with $O(\log n)$-bit words). At first glance, our lower bound would seem to render retrieval unusable in many settings that aim to achieve very low redundancy. However, our second result offers a way around this: We show that, whenever a retrieval data structure $D_1$ is stored along with another data structure $D_2$ (whose size is similar to or larger than the size of $D_1$), it is possible to implement the combined data structure $D_1 \cup D_2$ so that queries to $D_1$ take $O(1)$ time, operations on $D_2$ take the same asymptotic time as if $D_2$ were stored on its own, and the total space is $nv + \mathrm{Space}(D_2) + n^{0.67}$ bits.

18 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
LCLijie Chen
Lijie Chen
YHYang Hu
Yang Hu
HRHanlin Ren
Hanlin Ren
The *algebrization barrier*, proposed by Aaronson and Wigderson (STOC '08, ToCT '09), captures the limitations of many complexity-theoretic techniques based on arithmetization. Notably, several circuit lower bounds that overcome the relativization barrier (Buhrman--Fortnow--Thierauf, CCC '98; Vinodchandran, TCS '05; Santhanam, STOC '07, SICOMP '09) remain subject to the algebrization barrier. In this work, we establish several new algebrization barriers to circuit lower bounds by studying the communication complexity of the following problem, called XOR-Missing-String: For $m < 2^{n/2}$, Alice gets a list of $m$ strings $x_1, \dots, x_m\in\{0, 1\}^n$, Bob gets a list of $m$ strings $y_1, \dots, y_m\in\{0, 1\}^n$, and the goal is to output a string $s\in\{0, 1\}^n$ that is not equal to $x_i\oplus y_j$ for any $i, j\in [m]$. 1. We construct an oracle $A_1$ and its multilinear extension $\widetilde{A_1}$ such that ${\sf PostBPE}^{\widetilde{A_1}}$ has linear-size $A_1$-oracle circuits on infinitely many input lengths. 2. We construct an oracle $A_2$ and its multilinear extension $\widetilde{A_2}$ such that ${\sf BPE}^{\widetilde{A_2}}$ has linear-size $A_2$-oracle circuits on all input lengths. 3. Finally, we study algebrization barriers to circuit lower bounds for $\sf MA_E$. Buhrman, Fortnow, and Thierauf proved a *sub-half-exponential* circuit lower bound for $\sf MA_E$ via algebrizing techniques. Toward understanding whether the half-exponential bound can be improved, we define a natural subclass of $\sf MA_E$ that includes their hard $\sf MA_E$ language, and prove the following result: For every *super-half-exponential* function $h(n)$, we construct an oracle $A_3$ and its multilinear extension $\widetilde{A_3}$ such that this natural subclass of ${\sf MA}_{\sf E}^{\widetilde{A_3}}$ has $h(n)$-size $A_3$-oracle circuits on all input lengths.