On the efficiency of effective Nullstellensätze
Let k be an infinite and perfect field, x1, ..., xn indeterminates over k and let f1, ..., fs be polynomials in k[x1, ..., xn] of degree bounded by a given number d, which satisfies d≥n. We prove an effective affine Nullstellensatz of the following particular form: For arbitrary given parameters d,...
Guardado en:
| Autores principales: | Giusti, M., Heintz, J., Sabia, J. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_10163328_v3_n1_p56_Giusti |
| Aporte de: |
Ejemplares similares
-
On the efficiency of effective Nullstellensätze
por: Sabia, Juan Vicente Rafael
Publicado: (1993) -
On the time-space complexity of geometric elimination procedures
por: Heintz, J., et al. -
Complexity bounds in elimination theory - A survey
Publicado: (1996) -
Complexity bounds in elimination theory - A survey
por: Solernó, P. -
Algorithmic aspects of Suslin's proof of Serre's conjecture
por: Caniglia, L., et al.