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.
- Counting critical formations on the circle: algebraic-geometric and Morse-theoretic bounds (Q305693) (← links)
- Effective differential Lüroth's theorem (Q402415) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field (Q473082) (← links)
- Variety evasive sets (Q475333) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- Explicit estimates for the number of rational points of singular complete intersections over a finite field (Q495273) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- A linear algebra approach to the differentiation index of generic DAE systems (Q733711) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Effective difference elimination and nullstellensatz (Q783738) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time (Q809149) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- Computation of differential Chow forms for ordinary prime differential ideals (Q895970) (← links)
- Effective uniform bounding in partial differential fields (Q900852) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Probabilistic algorithms for computing resolvent representations of regular differential ideals (Q985372) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- Real quantifier elimination is doubly exponential (Q1114669) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- Equations for the projective closure and effective Nullstellensatz (Q1180147) (← links)
- 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 (Q1185456) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- Implicitization of rational parametric equations (Q1209624) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Topology of generic multijet preimages and blow-up via Newton interpolation (Q1277061) (← links)
- Trajectories of polynomial vector fields and ascending chains of polynomial ideals (Q1288648) (← links)
- A sparse effective Nullstellensatz (Q1291069) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Construction of roadmaps in semi-algebraic sets (Q1311619) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz (Q1358930) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
