On the number of sets definable by polynomials
We show that the known algorithms used to re-write any first order quantifier-free formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynom...
Guardado en:
| Publicado: |
2000
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00218693_v227_n2_p633_Jeronimo http://hdl.handle.net/20.500.12110/paper_00218693_v227_n2_p633_Jeronimo |
| Aporte de: |
Ejemplares similares
-
On the number of sets definable by polynomials
por: Jeronimo, G., et al. -
Affine solution sets of sparse polynomial systems
Publicado: (2013) -
Affine solution sets of sparse polynomial systems
por: Herrero, M.I., et al. -
Intrinsic complexity estimates in polynomial optimization
Publicado: (2014) -
Intrinsic complexity estimates in polynomial optimization
por: Bank, B., et al.