Pages that link to "Item:Q5301590"
From MaRDI portal
The following pages link to Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Q5301590):
Displayed 39 items.
- Power series and linear difference equations (Q5301591) (← links)
- Digital atlases and difference forms (Q5301592) (← links)
- Can we create a viable free open source alternative to magma, maple, mathematica and matlab? (Q5301593) (← links)
- Towards a computer algebraic algorithm for flat output determination (Q5301595) (← links)
- Regular systems of linear functional equations and applications (Q5301596) (← links)
- Products of ordinary differential operators by evaluation and interpolation (Q5301597) (← links)
- Implicitization and parametrization of quadratic surfaces with one simple base point (Q5301598) (← links)
- Solving differential equations in terms of bessel functions (Q5301601) (← links)
- On the computation of the topology of a non-reduced implicit space curve (Q5301602) (← links)
- Q-adic transform revisited (Q5301604) (← links)
- Computing the global optimum of a multivariate polynomial over the reals (Q5301605) (← links)
- Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities (Q5301606) (← links)
- Complete subdivision algorithms, II (Q5301608) (← links)
- A pommaret division algorithm for computing Grobner bases in boolean rings (Q5301609) (← links)
- On lacunary polynomial perfect powers (Q5301610) (← links)
- Plane geometry and convexity of polynomial stability regions (Q5301611) (← links)
- An algorithm for finding symmetric Grobner bases in infinite dimensional rings (Q5301612) (← links)
- Moment matrices, trace matrices and the radical of ideals (Q5301614) (← links)
- Integration of algebraic functions (Q5301615) (← links)
- Expressing a fraction of two determinants as a determinant (Q5301616) (← links)
- Symbolic optimization of algebraic functions (Q5301617) (← links)
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars (Q5301618) (← links)
- Computational D-module theory with singular, comparison with other systems and two new algorithms (Q5301620) (← links)
- Complex brackets, balanced complex differences, and applications in symbolic geometric computing (Q5301621) (← links)
- The complete root classification of a parametric polynomial on an interval (Q5301622) (← links)
- Deciding polynomial-exponential problems (Q5301626) (← links)
- A rational decomposition-lemma for systems of linear differential-algebraic equations (Q5301628) (← links)
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629) (← links)
- Multi-modular algorithm for computing the splitting field of a polynomial (Q5301630) (← links)
- Linearizablity of 1 (Q5301631) (← links)
- Integro-differential polynomials and operators (Q5301632) (← links)
- Power series composition and change of basis (Q5301633) (← links)
- Loewy decomposition of third-order linear aPDE's in the plane (Q5301634) (← links)
- The nearest polynomial with a zero in a given domain from a geometrical viewpoint (Q5301635) (← links)
- Moving frames for laplace invariants (Q5301636) (← links)
- Computing the multiplicity structure from geometric involutive form (Q5301639) (← links)
- Exact algorithms and software in optimization and polyhedral computation (Q5301640) (← links)
- Algorithmic invariant theory (Q5301641) (← links)
- Algebraic algorithms and coding theory (Q5301642) (← links)