Weiqiang Yuan

About Me

Hi, I am a fourth-year Ph. D. student at the Theory Group of EPFL, fortunate to be coadvised by Mika Göös and Ola Svensson. Prior to that, I obtained my Bachelor degree from IIIS, Tsinghua University.
I have broad interests in theoretical computer science, especially complexity theory.

Publications

See also Google Scholar | dblp.

• Searching for Falsified Clause in Random (log(n))-CNFs is Hard for Randomized Communication
  Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, and Weiqiang Yuan
  in submission
• Generalised Linial-Nisan Conjecture is False for DNFs
  Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, and Weiqiang Yuan
  to appear in CCC 2025
• Direct Sum for Parity Decision Trees
  Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, and Weiqiang Yuan
  to appear in CCC 2025
• Breaking Verifiable Delay Functions in the Random Oracle Model
  Ziyi Guan, Artur Riazanov, and Weiqiang Yuan
  to appear in Crypto 2025
• One-Way Functions vs. TFNP: Simpler and Improved
  Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, and Weiqiang Yuan
  ITCS 2024
• The Exact Bipartite Matching Polytope Has Exponential Extension Complexity
  Xinrui Jia, Ola Svensson, and Weiqiang Yuan
  SODA 2023
• Lower Bounds for Unambiguous Automata via Communication Complexity
  Mika Göös, Stefan Kiefer, and Weiqiang Yuan
  ICALP 2022 (Track B)
• Log-rank and lifting for AND-functions
  Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan
  STOC 2021
• Guest Column: Models of computation between decision trees and communication
  Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan
  SIGACT News

Contact

Email: firstname.lastname@epfl.ch