Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Sidon sets:
TR22-139 | 15th October 2022
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan

On the VNP-hardness of Some Monomial Symmetric Polynomials

A polynomial $P\in F[x_1,\ldots,x_n]$ is said to be symmetric if it is invariant under any permutation of its input variables. The study of symmetric polynomials is a classical topic in mathematics, specifically in algebraic combinatorics and representation theory. More recently, they have been studied in several works in computer science, ... more >>>

ISSN 1433-8092 | Imprint