论文标题
高级张量和多项式图的随机限制
Random restrictions of high-rank tensors and polynomial maps
论文作者
论文摘要
由计算复杂性问题的激励，我们考虑了在随机坐标限制下的张量和多项式图的等级函数的行为。我们表明，对于称为自然级别函数的广泛等级函数，对密集集的随机坐标限制通常最多将排名最多减少。
Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank functions, random coordinate restriction to a dense set will typically reduce the rank by at most a constant factor.
