5 problems

Let $\mathrm{dc}(\mathrm{per}_m)$ be the determinantal complexity of the $m\times m$ permanent. For integers $d,n,m$, let $\gamma_{\lambda,d,n,m}$ and $\delta_{\lambda,d,n}$ denote…

Landsberg–Ressayre conjecture. The quantities $\operatorname{\mathsf{edc}}$ and $\operatorname{\mathsf{dc}}$ are polynomially related. If true, this would imply…

Constructed-family determinantal lower-bound conjecture. If $a>0$ is small enough, then, with high probability, $f_n$ cannot be expressed as a symbolic determinant of size at most…

VPws versus its closure conjecture.

VNP versus approximative VPws conjecture.