Weiqiang Yuan

According to our database, Weiqiang Yuan authored at least 13 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Quantum Advantage in Tolerant Junta Testing.

Avishay Tal, Weiqiang Yuan

Electron. Colloquium Comput. Complex., 2026

Pseudodeterministic Communication Complexity.

Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case.

Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Total Search Problems in ZPP.

Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

Breaking Verifiable Delay Functions in the Random Oracle Model.

Ziyi Guan, Artur Riazanov, Weiqiang Yuan

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Direct Sums for Parity Decision Trees.

Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 40th Computational Complexity Conference, 2025

Generalised Linial-Nisan Conjecture Is False for DNFs.

Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan

Proceedings of the 40th Computational Complexity Conference, 2025

Searching for Falsified Clause in Random (log{n})-CNFs Is Hard for Randomized Communication.

Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan

Proceedings of the Approximation, 2025

2024

One-Way Functions vs. TFNP: Simpler and Improved.

Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity.

Xinrui Jia, Ola Svensson, Weiqiang Yuan

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Lower Bounds for Unambiguous Automata via Communication Complexity.

Mika Göös, Stefan Kiefer, Weiqiang Yuan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Guest Column: Models of computation between decision trees and communication.

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

SIGACT News, 2021

Log-rank and lifting for AND-functions.

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021