Ben lee Volk

activity

20132026

most citedLower Bounds on Stabilizer Rank

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

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.CC2026

A Quadratic Lower Bound on Determinantal Complexity

Mrinal Kumar, Ben Lee Volk

We prove an $Ω (n^{2})$ lower bound on the determinantal complexity of the power sum polynomial $\sum_{i = 1}^{n} x_{i}^{n}$ over the field of complex numbers. A similar result was claimed in…

cs.CC2026

Improved Algorithms for the Remote Point Problem

Ben Lee Volk

The Remote Point Problem (RPP) is an algorithmic problem that asks, given a linear subspace $L \subseteq F^{n}$ of dimension $k$ , to deterministically find a vector $v \in \…

cs.CC2026

A Lower Bound for Read-Once Parity Branching Programs

Ben Lee Volk

We prove an $Ω ~ (n^{2})$ lower bound for read-once parity branching programs computing an explicit boolean function on $n$ variables. The previous best lower bound was $\tildeΩ(n…