On the number of sets definable by polynomials

DOI10.1006/jabr.1999.8243zbMath0956.68163OpenAlexW2055634856MaRDI QIDQ1569817

Juan Sabia, Gabriela Jeronimo

Publication date: 9 July 2000

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d6ad5a51ac713164668dbf9b5fd335c6e05857be

zbMATH Keywords

algorithmsalgebraically closed fieldalgebraic complexitydisjunctive normal formcomputational algebrafirst-order formulapolynomial-definable sets

Mathematics Subject Classification ID

Related Items (2)

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I

Cites Work

• Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
• Definability and fast quantifier elimination in algebraically closed fields
• Complexity of deciding Tarski algebra
• Lower Bounds for Approximation by Nonlinear Manifolds
• Unnamed Item

This page was built for publication: On the number of sets definable by polynomials