AbstractLet P(X)=1+a1X+a2X2+⋯ be a monic power series in X with indeterminates a1,a2,… as coefficients. The coefficients b1,b2,… of the inverse of P are polynomials in the coefficients of P. We prove that if divisions are forbidden, then at least n+2⌊n/3⌋-3 essential multiplications are needed to compute b1,…,bn from a1,…,an over fields of characteristic two
AbstractLet Fr denote a finite field with r elements. Let q be a power of a prime, and p1,p2, p3 be ...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...
International audienceIn an earlier article together with Carlos D'Andrea [BDKSV2017], we describede...
AbstractLet P(X)=1+a1X+a2X2+⋯ be a monic power series in X with indeterminates a1,a2,… as coefficien...
AbstractFrom the existence of a tower of algebraic function fields with more steps than the Garcia–S...
AbstractFrom the existence of algebraic function fields having some good properties, we obtain some ...
Let μq2(n,k) denote the minimum number of multiplications required to compute the coefficients of th...
AbstractLet A=Fq[t] denote the ring of polynomials over the finite field Fq. We denote by e a certai...
AbstractLet n,ℓ be positive integers with ℓ≤2n−1. Let R be an arbitrary nontrivial ring, not necessa...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fracti...
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fracti...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe prove that multiplying two third degree polynomials over Z2 requires nin multiplications....
AbstractLet Fr denote a finite field with r elements. Let q be a power of a prime, and p1,p2, p3 be ...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...
International audienceIn an earlier article together with Carlos D'Andrea [BDKSV2017], we describede...
AbstractLet P(X)=1+a1X+a2X2+⋯ be a monic power series in X with indeterminates a1,a2,… as coefficien...
AbstractFrom the existence of a tower of algebraic function fields with more steps than the Garcia–S...
AbstractFrom the existence of algebraic function fields having some good properties, we obtain some ...
Let μq2(n,k) denote the minimum number of multiplications required to compute the coefficients of th...
AbstractLet A=Fq[t] denote the ring of polynomials over the finite field Fq. We denote by e a certai...
AbstractLet n,ℓ be positive integers with ℓ≤2n−1. Let R be an arbitrary nontrivial ring, not necessa...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fracti...
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fracti...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
Since 1960 and the result of Karatsuba, we know that the complexity of the multiplication (of intege...
AbstractWe prove that multiplying two third degree polynomials over Z2 requires nin multiplications....
AbstractLet Fr denote a finite field with r elements. Let q be a power of a prime, and p1,p2, p3 be ...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...
International audienceIn an earlier article together with Carlos D'Andrea [BDKSV2017], we describede...
DOI
Add to ORKG