On the intrinsic complexity of the arithmetic Nullstellensatz

We show several arithmetic estimates for Hilbert's Nullstellensatz. This includes an algorithmic procedure computing the polynomials and constants occurring in a Bézout identity, whose complexity is polynomial in the geometric degree of the system. Moreover, we show for the first time height es...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Hägele, K., Morais, J. E., Pardo, L. M., Sombra, Martín
Formato: Articulo
Lenguaje:Inglés
Publicado: 2000
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/83447
Aporte de:

Ejemplares similares