Pages that link to "Item:Q752692"

The following pages link to Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692):

Displaying 18 items.

• VPSPACE and a transfer theorem over the complex field (Q1034531) (← 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)
• Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
• An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
• Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
• Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
• On the number of sets definable by polynomials (Q1569817) (← links)
• Transfer theorems via sign conditions (Q1603522) (← links)
• Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
• Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
• Elimination for generic sparse polynomial systems (Q2249474) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
• On the number of zero-patterns of a sequence of polynomials (Q2719034) (← links)
• Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
• A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
• Back-and-forth systems for generic curves and a decision algorithm for the limit theory (Q5946087) (← links)
• Computing bases of complete intersection rings in Noether position (Q5946450) (← links)