The following pages link to (Q3992572):
Displaying 13 items.
- Coupled systems of non-smooth differential equations (Q414792) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- On the elements of sets with even partition function (Q895646) (← links)
- Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- The reduced Bautin index of planar vector fields (Q1974968) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
- ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON (Q5324324) (← links)
- Pythagoras numbers of real irreducible algebroid curves and Gram matrices (Q5936154) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
