Pages that link to "Item:Q1295548"
From MaRDI portal
The following pages link to An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548):
Displaying 13 items.
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- On the number of sets definable by polynomials (Q1569817) (← links)
- Polynomial bounds for invariant functions separating orbits (Q1758265) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Weak identifiability for differential algebraic systems (Q2701024) (← links)
- (Q2760201) (← links)
- Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants (Q3140555) (← links)
- Applying Linear Quantifier Elimination (Q3140556) (← links)
- A Quantifier Elimination Algorithm for Linear Real Arithmetic (Q5505558) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
- Computing bases of complete intersection rings in Noether position (Q5946450) (← links)