Definability and fast quantifier elimination in algebraically closed fields
From MaRDI portal
(Redirected from Publication:798314)
definabilityconstructible setBezout's theoremalgebraically closed fieldsprenex first order formulasquantifier elimination proceduretime bound
Model-theoretic algebra (03C60) Complexity of computation (including implicit computational complexity) (03D15) Quantifier elimination, model completeness, and related topics (03C10) Elementary questions in algebraic geometry (14A25) Applications of logic to commutative algebra (13L05) Connections between field theory and logic (12L99)
Recommendations
- scientific article; zbMATH DE number 3895043
- scientific article; zbMATH DE number 4014674
- On the combinatorial and algebraic complexity of quantifier elimination
- On the number of sets definable by polynomials
- scientific article; zbMATH DE number 871442
- Real quantifier elimination is doubly exponential
- Computer Science Logic
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- Quantifier elimination in separably closed fields of finite imperfectness degree
Cites work
- scientific article; zbMATH DE number 3685447 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 3765129 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3564960 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 3222940 (Why is no real title available?)
- scientific article; zbMATH DE number 3235754 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- scientific article; zbMATH DE number 3280853 (Why is no real title available?)
- scientific article; zbMATH DE number 3390942 (Why is no real title available?)
- An Extension of Strassen’s Degree Bound
- Constructions in Algebra
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Further Pathologies in Algebraic Geometry
- Generic local structure of the morphisms in commutative algebra
- Lower bounds for polynomials with algebraic coefficients
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Systems of distinct representatives and linear algebra
- The complexity of partial derivatives
Cited in
(only showing first 100 items - show all)- An algorithm for implicit interpolation
- Shifted varieties and discrete neighborhoods around varieties
- Effective uniform bounding in partial differential fields
- Effective de Rham cohomology — The general case
- On the complexity of computing a random Boolean function over the reals
- A parametric representation of totally mixed Nash equilibria
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
- Computing multihomogeneous resultants using straight-line programs
- Multilevel polynomial partitions and simplified range searching
- Degeneracy loci and polynomial equation solving
- On the value set of small families of polynomials over a finite field. I
- On the order of approximation in approximative triadic decompositions of tensors
- Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields
- Change of order for regular chains in positive dimension
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics
- Transfer theorems via sign conditions
- Irredundant bases for finite groups of Lie type
- The dimension growth conjecture, polynomial in the degree and without logarithmic factors
- Random algebraic construction of extremal graphs
- Variety evasive sets
- Evaluating geometric queries using few arithmetic operations
- On the bit complexity of polynomial system solving
- Algebraic dimension over Frobenius fields
- Complexity results for triangular sets
- Computational aspects of the coordinate ring of an algebraic variety
- A bibliography of quantifier elimination for real closed fields
- On the number of zero-patterns of a sequence of polynomials
- Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
- Factorization patterns on nonlinear families of univariate polynomials over a finite field
- Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem
- Definable equivalence relations on algebraically closed fields
- A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- On the parallel complexity of the polynomial ideal membership problem
- Algorithms yield upper bounds in differential algebra
- Improved complexity bounds for counting points on hyperelliptic curves
- scientific article; zbMATH DE number 3895043 (Why is no real title available?)
- On maps which preserve semipositivity and quantifier elimination theory for real numbers
- Puiseux expansions and nonisolated points in algebraic varieties
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Poisson algebras via model theory and differential-algebraic geometry
- Bit-size estimates for triangular sets in positive dimension
- WELL-FORMED SET REPRESENTATIONS OF SOLIDS
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Partial differential Chow forms and a type of partial differential Chow varieties
- Complexity of triangular representations of algebraic sets
- Lower bounds for diophantine approximations
- Sur la complexité du principe de Tarski-Seidenberg
- Effective differential Lüroth's theorem
- Variety evasive subspace families
- On Bézout inequalities for non-homogeneous polynomial ideals
- Quantitative aspects of the generalized differential Lüroth's theorem
- A Gröbner free alternative for polynomial system solving
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- Properness defects of projection and minimal discriminant variety
- A linear algebra approach to the differentiation index of generic DAE systems
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Elimination of constants from machines over algebraically closed fields
- Computing generators of the ideal of a smooth affine algebraic variety
- Polynomial bounds for invariant functions separating orbits
- On the computation of rational solutions of underdetermined systems over a finite field
- Complexity of deciding Tarski algebra
- On the complexity exponent of polynomial system solving
- Counting critical formations on the circle: algebraic-geometric and Morse-theoretic bounds
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Finding connected components of a semialgebraic set in subexponential time
- Straight-line programs in geometric elimination theory
- Distinct distances on curves via rigidity
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Polynomial equation solving by lifting procedures for ramified fibers
- On multiplicative energy of subsets of varieties
- Degree bound for toric envelope of a linear algebraic group
- A single exponential time algorithm for homogeneous regular sequence tests
- Topology of generic multijet preimages and blow-up via Newton interpolation
- Trajectories of polynomial vector fields and ascending chains of polynomial ideals
- On the geometry of polar varieties
- Deformation techniques for efficient polynomial equation solving.
- Fast computation of a rational point of a variety over a finite field
- Kronecker's and Newton's approaches to solving: a first comparison
- Interpolation by decomposable univariate polynomials
- The complexity of local dimensions for constructible sets
- Lower bound for the approximative complexity
- An incidence theorem in higher dimensions
- Quantifier elimination in separably closed fields of finite imperfectness degree
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- Distinct Distances on Algebraic Curves in the Plane
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- Generalized polar varieties and an efficient real elimination.
- Improved explicit estimates on the number of solutions of equations over a finite field
- On computing absolutely irreducible components of algebraic varieties with parameters
- Complexity of solving parametric polynomial systems
- On the efficiency of effective Nullstellensätze
- Semi-algebraic decision complexity, the real spectrum, and degree
- On the complexity of counting components of algebraic varieties
- On the complexity of the resolvent representation of some prime differential ideals
This page was built for publication: Definability and fast quantifier elimination in algebraically closed fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798314)
