Pages that link to "Item:Q2958904"
From MaRDI portal
The following pages link to Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Q2958904):
Displayed 42 items.
- On solutions of linear functional systems (Q2958905) (← links)
- Minimal decomposition of indefinite hypergeometric sums (Q2958906) (← links)
- On the Barnes function (Q2958907) (← links)
- Generic ideals and Moreno-Socías conjucture (Q2958909) (← links)
- Hybrid sparse resultant matrices for bivariate systems (Q2958910) (← links)
- Maple's evaluation process as constraint contextual rewriting (Q2958911) (← links)
- PARDI! (Q2958912) (← links)
- Residual resultant over the projective plane and the implicitization problem (Q2958913) (← links)
- Families of estimable terms (Q2958914) (← links)
- Computing all factorizations in *** (Q2958915) (← links)
- Computation of minimal generators of ideals of fat points (Q2958916) (← links)
- Towards factoring bivariate approximate polynomials (Q2958917) (← links)
- On Liouvillian solutions of linear differential equations of order 4 and 5 (Q2958918) (← links)
- Hybrid computation (Q2958919) (← links)
- Modeling inheritance as coercion in a symbolic computation system (Q2958920) (← links)
- Computation of the radical of polynomial ideals over fields of arbitrary characteristic (Q2958921) (← links)
- Polynomial root finding using iterated Eigenvalue computation (Q2958922) (← links)
- Semi-numerical determination of irreducible branches of a reduced space curve (Q2958923) (← links)
- A generalized Graeffe's iteration for evaluating polynomials and rational functions (Q2958924) (← links)
- Symbolic-interval cooperation in constraint programming (Q2958925) (← links)
- Unirational fields of transcendence degree one and functional decomposition (Q2958927) (← links)
- Solvability by radicals from an algorithmic point of view (Q2958928) (← links)
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures (Q2958929) (← links)
- The membership problem for ideals of binomial skew polynomial rings (Q2958934) (← links)
- Hybrid system for multi-language and multi-environment generation of numerical codes (Q2958935) (← links)
- Towards approximations which preserve integrals (Q2958936) (← links)
- On propagation of equational constraints in CAD-based quantifier elimination (Q2958937) (← links)
- A linear space algorithm for computing the hermite normal form (Q2958938) (← links)
- Remarks on Gröbner basis for ideals under composition (Q2958939) (← links)
- Algorithms for trigonometric polynomials (Q2958941) (← links)
- Univariate polynomials (Q2958942) (← links)
- New complexity bounds for cylindrical decompositions of sub-pfaffian sets (Q2958944) (← links)
- A multivariate Weierstrass iterative rootfinder (Q2958945) (← links)
- Approximate multivariate polynomial factorization based on zero-sum relations (Q2958946) (← links)
- Discrete comprehensive Gröbner bases (Q2958947) (← links)
- Black box methods for least squares problems (Q2958948) (← links)
- On a parallel Lehmer-Euclid GCD algorithm (Q2958950) (← links)
- Computation of the degree of rational maps between curves (Q2958951) (← links)
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm (Q2958952) (← links)
- Irreducible trinomials over finite fields (Q2958953) (← links)
- On computer-assisted classification of coupled integrable equations (Q5892264) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5892265) (← links)