DOIAbstract
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times the fundamental theorem on symmetric functions is applicable. In this paper a sharp upper bound on this measure is derived by a matrix method
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times the fundamental theorem on symmetric functions is applicable. In this paper a sharp upper bound on this measure is derived by a matrix method
In the query model of multivariate function computation, the values of the inputs are queried se-que...
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions...
In this paper we explore inequalities between symmetric homogeneous polynomials of degree four of th...
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times th...
By the fundamental theorem of symmetric polynomials, if P ∈ Q[X1,...,Xn] is symmetric, then it can b...
| openaire: EC/H2020/759557/EU//ALGOComThe fundamental theorem of symmetric polynomials states that ...
In this thesis we consider the boolean elementary symmetric functions over a field with characterist...
Recently, the interest to polynomial representations of functions over finite fields and over finite...
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functi...
One of the main goals of theoretical computer science is to prove limits on how efficiently certain ...
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate ...
AbstractThe multiplicative complexity of a Boolean function f is defined as the minimum number of bi...
AbstractA quadratic upper bound is obtained for the complexity of symbol sequences generated by symm...
AbstractWe study the problem of representing symmetric Boolean functions as symmetric polynomials ov...
We discuss a recent convergence of notions of symmetric computation arising in the theory of linear ...
In the query model of multivariate function computation, the values of the inputs are queried se-que...
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions...
In this paper we explore inequalities between symmetric homogeneous polynomials of degree four of th...
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times th...
By the fundamental theorem of symmetric polynomials, if P ∈ Q[X1,...,Xn] is symmetric, then it can b...
| openaire: EC/H2020/759557/EU//ALGOComThe fundamental theorem of symmetric polynomials states that ...
In this thesis we consider the boolean elementary symmetric functions over a field with characterist...
Recently, the interest to polynomial representations of functions over finite fields and over finite...
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functi...
One of the main goals of theoretical computer science is to prove limits on how efficiently certain ...
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate ...
AbstractThe multiplicative complexity of a Boolean function f is defined as the minimum number of bi...
AbstractA quadratic upper bound is obtained for the complexity of symbol sequences generated by symm...
AbstractWe study the problem of representing symmetric Boolean functions as symmetric polynomials ov...
We discuss a recent convergence of notions of symmetric computation arising in the theory of linear ...
In the query model of multivariate function computation, the values of the inputs are queried se-que...
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions...
In this paper we explore inequalities between symmetric homogeneous polynomials of degree four of th...
Add to ORKG