Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > BORDER DETERMINANTAL COMPLEXITY:
Reports tagged with border determinantal complexity:
TR26-275 | 20th October 2026
Karthik Sheshadri

Smooth slices and the limits of determinantal lower bounds

In an earlier note (arXiv:2606.11090) I showed that the border determinantal complexity of the power sum x_1^d + ... + x_N^d is ?(Nd). The proof counted the simple solutions of an explicit polynomial system and compared that number with what a small determinant can produce. This left two questions. Does ... more >>>




ISSN 1433-8092 | Imprint