AbstractFor given f1,…,fm ϵ K[x] which are relatively prime we present degree bounds on the ai needed to express 1 and other "low degree" polynomials as ∑aifi. This paper gives an improvement on Kakié's bound (Kakié, 1976)
The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a...
AbstractWe present a very simple method to prove lower bounds for the nonscalar complexity of polyno...
AbstractWe give an overview of the ideas from Complex Analysis which provide the solution Qj of the ...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Lin...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary ...
The so called weak form of the Hilbert's Nullstellensatz says that a system of algebraic equati...
The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a...
AbstractWe present a very simple method to prove lower bounds for the nonscalar complexity of polyno...
AbstractWe give an overview of the ideas from Complex Analysis which provide the solution Qj of the ...
AbstractWe give a method, based on algebraic geometry, to show lower bounds for the complexity of po...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Lin...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary ...
The so called weak form of the Hilbert's Nullstellensatz says that a system of algebraic equati...
The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a...
AbstractWe present a very simple method to prove lower bounds for the nonscalar complexity of polyno...
AbstractWe give an overview of the ideas from Complex Analysis which provide the solution Qj of the ...
DOI
Add to ORKG