On the VNP-hardness of some monomial symmetric polynomials

DOI10.4230/LIPICS.FSTTCS.2022.16MaRDI QIDQ6604619zbMATH OpenFDO

Authors Radu Curticapean, Nutan Limaye, Srikanth Srinivasan

Publication date 12 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2022.16

zbMATH Keywords

algebraic complexitypermanentSidon setsymmetric polynomial

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(1)

• Low-depth algebraic circuit lower bounds over any field

This page was built for publication: On the VNP-hardness of some monomial symmetric polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604619)