Guangxu Yang

activity

20212026

most citedLifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

Exponential Quantum Space Advantage for Approximating Max- $k$ SAT in the Streaming Setting

Haoyu Wang, Guangxu Yang

In this paper, we give a one-pass quantum streaming algorithm for Max- $k$ SAT that uses $polylog (n)$ space and achieves a $0.7172$ -approximation on instances with $n$ …

Exponential Quantum Space Advantage for Approximating Max-kSAT in the Streaming Setting

Exponential Quantum Space Advantage for Approximating Max- $k$ SAT in the Streaming Setting