Publications

One-Way Functions vs. TFNP: Simpler and Improved [ITCS] [eprint]
Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
15th Innovations in Theoretical Computer Science (ITCS 2024)

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity [SODA] [arxiv]
Xinrui Jia, Ola Svensson, Weiqiang Yuan
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)

Lower Bounds for Unambiguous Automata via Communication Complexity [ICALP] [eccc]
Mika Göös, Stefan Kiefer, Weiqiang Yuan
49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022)

Log-rank and lifting for AND-functions [STOC] [eccc]
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
53rd Annual ACM Symposium on Theory of Computing (STOC 2021)

Guest Column: Models of computation between decision trees and communication [SIGACT]
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
SIGACT news, Volume 52, No. 2, 2021