En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Audiovisual Mathematics Library

Audiovisual Mathematics Library

Documents 12-XX 2 results

Filter
Select: All / None
Q
K | F x r
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Effective bounds for polynomial systems defined over the rationals - lecture 2 - Krick, Teresa (Author of the conference) | CIRM H

Multi angle

Given a computer algebra problem described by polynomials with rational coefficients, I will present various tools that help measuring the cost of solving it, where cost means giving bounds for the degrees and heights (i.e. bit-sizes) of the output in terms of those of the input data. I will detail an arithmetic Bézout inequality and give some applications to zero-dimensional polynomial systems. I will also speak about the Nullstellensatz and Perron's theorem for implicitization, if time permits.[-]
Given a computer algebra problem described by polynomials with rational coefficients, I will present various tools that help measuring the cost of solving it, where cost means giving bounds for the degrees and heights (i.e. bit-sizes) of the output in terms of those of the input data. I will detail an arithmetic Bézout inequality and give some applications to zero-dimensional polynomial systems. I will also speak about the Nullstellensatz and ...[+]

11-XX ; 12-XX ; 14-XX

Bookmarks

Cochez un panier pour y ajouter l'enregistrement. Décochez-le pour l'en enlever.

4

Manage my selections

Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Effective bounds for polynomial systems defined over the rationals - lecture 1 - Krick, Teresa (Author of the conference) | CIRM H

Multi angle

Given a computer algebra problem described by polynomials with rational coefficients, I will present various tools that help measuring the cost of solving it, where cost means giving bounds for the degrees and heights (i.e. bit-sizes) of the output in terms of those of the input data. I will detail an arithmetic Bézout inequality and give some applications to zero-dimensional polynomial systems. I will also speak about the Nullstellensatz and Perron's theorem for implicitization, if time permits.[-]
Given a computer algebra problem described by polynomials with rational coefficients, I will present various tools that help measuring the cost of solving it, where cost means giving bounds for the degrees and heights (i.e. bit-sizes) of the output in terms of those of the input data. I will detail an arithmetic Bézout inequality and give some applications to zero-dimensional polynomial systems. I will also speak about the Nullstellensatz and ...[+]

11-XX ; 12-XX ; 14-XX

Bookmarks

Cochez un panier pour y ajouter l'enregistrement. Décochez-le pour l'en enlever.

4

Manage my selections

Report an error

List: nb of elts/page

Select: All / None