The following pages link to (Q3728104):
Displaying 9 items.
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Feasibility testing for systems of real quadratic equations (Q2368126) (← links)
