2 papers
cs.CC2025
Computing the Elementary Symmetric Polynomials in Positive Characteristics
Ian Orzel
We first extend the results of Chatterjee, Kumar, Shi, Volk (Computational Complexity 2022) by showing that the degree- elementary symmetric polynomials in variables have ar…
cs.CC2025
The Algebraic Cost of a Boolean Sum
Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas +1
It is a well-known fact that the permanent polynomial is complete for the complexity class VNP, and it is largely suspected that the determinant does not share this property, despi…