Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
The hardest explicit construction
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 6roles
background 1polarities
background 1representative citing papers
The Nesting Bird Box Problem is ER-complete.
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
Languages requiring exponential-size circuits are comeager in S^E_2.
citing papers explorer
-
Strict Hierarchy for Quantum Channel Certification to Unitary
Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
-
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
The Nesting Bird Box Problem is ER-complete.
-
An Improved Construction of Variety-Evasive Subspace Families
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
-
An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
-
Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
-
Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
Languages requiring exponential-size circuits are comeager in S^E_2.