Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Chin Ho Lee:

TR23-102 | 13th July 2023
Chin Ho Lee, Edward Pyne, Salil Vadhan

On the Power of Regular and Permutation Branching Programs

We give new upper and lower bounds on the power of several restricted classes of arbitrary-order read-once branching programs (ROBPs) and standard-order ROBPs (SOBPs) that have received significant attention in the literature on pseudorandomness for space-bounded computation.

Regular SOBPs of length $n$ and width $\lfloor w(n+1)/2\rfloor$ can exactly simulate general ... more >>>

TR22-034 | 3rd March 2022
Chin Ho Lee, Edward Pyne, Salil Vadhan

Fourier Growth of Regular Branching Programs

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of read-once regular branching programs.
We prove that every read-once regular branching program $B$ of width $w \in [1,\infty]$ with $s$ accepting states on $n$-bit inputs must have its $L_{1,k}$ bounded by
\min\left\{ ... more >>>

ISSN 1433-8092 | Imprint