Weiqiang Yuan

According to our database, Weiqiang Yuan authored at least 10 papers between 2020 and 2025.

Collaborative distances:

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

2025

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

Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan

CoRR, July, 2025

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

Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan

Electron. Colloquium Comput. Complex., 2025

Generalised Linial-Nisan Conjecture is False for DNFs.

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

Electron. Colloquium Comput. Complex., 2025

2024

Breaking Verifiable Delay Functions in the Random Oracle Model.

Ziyi Guan, Artur Riazanov, Weiqiang Yuan

IACR Cryptol. ePrint Arch., 2024

Direct Sums for Parity Decision Trees.

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

Electron. Colloquium Comput. Complex., 2024

2023

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

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

IACR Cryptol. ePrint Arch., 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

Electron. Colloquium Comput. Complex., 2022

2021

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

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

SIGACT News, 2021

2020

Log-rank and lifting for AND-functions.

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

Electron. Colloquium Comput. Complex., 2020