A Lower Bound for Read-Once Parity Branching Programs
Abstract
We prove an Ω(n2) lower bound for read-once parity branching programs computing an explicit boolean function on n variables. The previous best lower bound was Ω(n1.5). Our lower bound is proved by reducing the problem to a lower bound in algebraic circuit complexity.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.