A Lower Bound for Read-Once Parity Branching Programs

Ben Lee Volk

A Lower Bound for Read-Once Parity Branching Programs

计算复杂性 2026-07-07 v1

作者: Ben Lee Volk

摘要

We prove an $\tilde{\Omega}(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{\Omega}(n^{1.5})$ . Our lower bound is proved by reducing the problem to a lower bound in algebraic circuit complexity.

引用

@article{arxiv.2607.05944,
  title  = {A Lower Bound for Read-Once Parity Branching Programs},
  author = {Ben Lee Volk},
  journal= {arXiv preprint arXiv:2607.05944},
  year   = {2026}
}