Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dwivedi, Prateek, Pago, Benedikt, Seppelt, Tim
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity Discrete Mathematics Logic in Computer Science Group Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2601.09343