Add to ORKGWe present a new software for computing Newton polytopes of resultant and discriminant polynomials. We illustrate its use with a number of examples
Newton polytopes play a prominent role in the study of sparse polynomial systems, where they help fo...
Polynomial algebra offers a standard approach to handle severalproblems in geometric modeling. A key...
We introduce and describe the Newton polyhedron related to a “minimal” counterexample to the Jacobia...
We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant ...
We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant p...
We design an algorithm to compute the Newton polytope of the re-sultant, known as resultant polytope...
For a system of polynomials with A = (A_1, ..., A_k) as supports, the Newton polytope of the resulta...
Abstract. We consider sparse elimination theory in order to describe the Newton polytope of the spar...
International audienceWe formalize an algorithm to change the representation of a polynomial to a Ne...
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and alg...
The Newton polytope of the resultant, or resultant polytope, characterizes the resultant polynomial ...
AbstractWe propose a new lifting and recombination scheme for rational bivariate polynomial factoriz...
The contribution of the thesis is threefold. The first Problem is computing the discriminant, when t...
Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, $$\eqlabel(\Input...
La résolution de systèmes polynomiaux est l’un des problèmes les plus anciens et importants en mathé...
Newton polytopes play a prominent role in the study of sparse polynomial systems, where they help fo...
Polynomial algebra offers a standard approach to handle severalproblems in geometric modeling. A key...
We introduce and describe the Newton polyhedron related to a “minimal” counterexample to the Jacobia...
We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant ...
We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant p...
We design an algorithm to compute the Newton polytope of the re-sultant, known as resultant polytope...
For a system of polynomials with A = (A_1, ..., A_k) as supports, the Newton polytope of the resulta...
Abstract. We consider sparse elimination theory in order to describe the Newton polytope of the spar...
International audienceWe formalize an algorithm to change the representation of a polynomial to a Ne...
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and alg...
The Newton polytope of the resultant, or resultant polytope, characterizes the resultant polynomial ...
AbstractWe propose a new lifting and recombination scheme for rational bivariate polynomial factoriz...
The contribution of the thesis is threefold. The first Problem is computing the discriminant, when t...
Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, $$\eqlabel(\Input...
La résolution de systèmes polynomiaux est l’un des problèmes les plus anciens et importants en mathé...
Newton polytopes play a prominent role in the study of sparse polynomial systems, where they help fo...
Polynomial algebra offers a standard approach to handle severalproblems in geometric modeling. A key...
We introduce and describe the Newton polyhedron related to a “minimal” counterexample to the Jacobia...