Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SVYATOSLAV GRYAZNOV:
All reports by Author Svyatoslav Gryaznov:

TR26-133 | 7th August 2026
Michal Garlik, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret

The Weak Rank Principle: Lower Bounds and Applications

Given two symbolic matrices $X$ and $Y$ of dimensions $m\times n$ and $n\times m$, respectively, the *rank principle* states that when $m = n+1$ and $A$ is a scalar matrix of rank $n+1$, the equation $XY = A$ is unsatisfiable. When $m$ is arbitrarily larger than $n$ and $A$ has ... more >>>




ISSN 1433-8092 | Imprint