Pages that link to "Item:Q798314"
From MaRDI portal
The following pages link to Definability and fast quantifier elimination in algebraically closed fields (Q798314):
Displaying 50 items.
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- On the number of sets definable by polynomials (Q1569817) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- Transfer theorems via sign conditions (Q1603522) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- Polynomial bound on the local Betti numbers of a real analytic germ (Q1687868) (← links)
- Configurations of lines in space and combinatorial rigidity (Q1688861) (← links)
- Complexity of triangular representations of algebraic sets (Q1714872) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- The dynamical Mordell-Lang problem for Noetherian spaces (Q1744933) (← links)
- Polynomial bounds for invariant functions separating orbits (Q1758265) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Lower bound for the approximative complexity (Q1822498) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
- Bounds of traces in complete intersections and degrees in the Nullstellensatz (Q1901475) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- On the affine Bezout inequality (Q1911215) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- The number of reducible space curves over a finite field (Q1938580) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields (Q1994944) (← links)
- Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem (Q2003990) (← links)
- On Bézout inequalities for non-homogeneous polynomial ideals (Q2028993) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Bounds on the torsion subgroup schemes of Néron-Severi group schemes (Q2089658) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- On the number of solutions of systems of certain diagonal equations over finite fields (Q2116748) (← links)
- The dimension growth conjecture, polynomial in the degree and without logarithmic factors (Q2212121) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Distinct distances on curves via rigidity (Q2249479) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- On the geometry of polar varieties (Q2267371) (← links)
- Complexity of deciding the first-order theory of real closed fields (Q2277024) (← links)
- Factorization patterns on nonlinear families of univariate polynomials over a finite field (Q2304196) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- On the number of points of algebraic sets over finite fields (Q2349351) (← links)
- Sparse differential resultant for Laurent differential polynomials (Q2351806) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties (Q2357363) (← links)
- Poisson algebras via model theory and differential-algebraic geometry (Q2359444) (← links)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
