Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 42 results in range #1 to #42.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Hybrid computation: Label: en
  2. On Liouvillian solutions of linear differential equations of order 4 and 5: Label: en
  3. Towards factoring bivariate approximate polynomials: Label: en
  4. Computation of minimal generators of ideals of fat points: Label: en
  5. Computing all factorizations in ***: Label: en
  6. Families of estimable terms: Label: en
  7. Residual resultant over the projective plane and the implicitization problem: Label: en
  8. PARDI!: Label: en
  9. Maple's evaluation process as constraint contextual rewriting: Label: en
  10. Hybrid sparse resultant matrices for bivariate systems: Label: en
  11. Generic ideals and Moreno-Socías conjucture: Label: en
  12. On the Barnes function: Label: en
  13. Minimal decomposition of indefinite hypergeometric sums: Label: en
  14. On solutions of linear functional systems: Label: en
  15. Irreducible trinomials over finite fields: Label: en
  16. Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm: Label: en
  17. Computation of the degree of rational maps between curves: Label: en
  18. A probabilistic algorithm to test local algebraic observability in polynomial time: Label: en
  19. On a parallel Lehmer-Euclid GCD algorithm: Label: en
  20. Black box methods for least squares problems: Label: en
  21. Discrete comprehensive Gröbner bases: Label: en
  22. Approximate multivariate polynomial factorization based on zero-sum relations: Label: en
  23. A multivariate Weierstrass iterative rootfinder: Label: en
  24. New complexity bounds for cylindrical decompositions of sub-pfaffian sets: Label: en
  25. Univariate polynomials: Label: en
  26. Algorithms for trigonometric polynomials: Label: en
  27. Remarks on Gröbner basis for ideals under composition: Label: en
  28. A linear space algorithm for computing the hermite normal form: Label: en
  29. On propagation of equational constraints in CAD-based quantifier elimination: Label: en
  30. Towards approximations which preserve integrals: Label: en
  31. Hybrid system for multi-language and multi-environment generation of numerical codes: Label: en
  32. The membership problem for ideals of binomial skew polynomial rings: Label: en
  33. Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures: Label: en
  34. Solvability by radicals from an algorithmic point of view: Label: en
  35. Unirational fields of transcendence degree one and functional decomposition: Label: en
  36. Symbolic-interval cooperation in constraint programming: Label: en
  37. A generalized Graeffe's iteration for evaluating polynomials and rational functions: Label: en
  38. Semi-numerical determination of irreducible branches of a reduced space curve: Label: en
  39. On computer-assisted classification of coupled integrable equations: Label: en
  40. Polynomial root finding using iterated Eigenvalue computation: Label: en
  41. Computation of the radical of polynomial ideals over fields of arbitrary characteristic: Label: en
  42. Modeling inheritance as coercion in a symbolic computation system: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)