Skip to content

Author

Yan Zhong

We have 3 of 10 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Oct 2026

Short Point Lists for CNFs and Stronger Constant-Depth Circuit Hardness

We give a short-description decomposition of bounded-width CNFs. For every fixed $\varepsilon>0$, every width-$b$ CNF on $m$ variables is an exact disjoint union of at most $2^{\varepsilon m}$ width-$b$ CNFs, each determined by $2^{O_\varepsilon(b)}\log(m+1)$ satisfying assignments. For every fixed $d\ge3$, we prove a...

Xin Li, Yan Zhong · 2 citations
Preprint Sep 2026

Many Proof Complexity Generators Inside One Demi-Bits Generator

For a propositional proof system $\mathcal{P}$ and a polynomial-time function $G: \{0, 1\}^n \to \{0, 1\}^N$ ($N>10n$), we say that $G$ is a *proof complexity generator* against $\mathcal{P}$ if $\mathcal{P}$ cannot efficiently prove the (suitably encoded) statement"$y\not\in\mathrm{Range}(G)$"for every $y \in \{0, 1\}...

Xin Li, Han-Lin Ren, Yan Zhong · 0 citations
Preprint Sep 2026

Exponential Sampling Lower Bounds for Polynomial Sources

A degree-$d$ polynomial source is the output of a polynomial map of degree at most $d$ over $\mathbb{F}_2$ on arbitrarily many uniform random bits. Khodabandeh and Shinkar (FOCS'26) proved that $\mathrm{Ber}(1/3)^{\otimes N}$ has statistical distance $1-o(1)$ from every constant-degree polynomial source and conjectured...

Yan Zhong · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.