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 50 results in range #51 to #100.

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

  1. Algebraic invariants of graphs; a study based on computer exploration: Label: en
  2. Resistance scaling and random walk dimensions for finitely ramified Sierpinski carpets: Label: en
  3. OpenMath: Label: en
  4. OpenMath: Label: en
  5. Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications: Label: en
  6. Gröbner bases specialization through Hilbert functions: Label: en
  7. Square-free decomposition in finite characteristic: Label: en
  8. Comparison of polynomial-oriented computer algebra systems: Label: en
  9. The nearest polynomial with a given zero, and similar problems: Label: en
  10. Invariants of binary forms: Label: en
  11. Good non-zeros of polynomials: Label: en
  12. Effective homology of a classifying space: Label: en
  13. Generating numerical ODE formulas via a symbolic calculus of divided differences: Label: en
  14. Symbolic computation of divided differences: Label: en
  15. Database of the special functions of mathematical physics: Label: en
  16. Unified method for determining canonical forms of a matrix: Label: en
  17. Factorization of linear partial differential operators and Darboux integrability of nonlinear PDEs: Label: en
  18. Cancellation errors in multivariate resultant computation with floating-point numbers: Label: en
  19. Block solution of sparse linear systems over GF (q): Label: en
  20. Unmixed and prime decomposition of radicals of polynomial ideals: Label: en
  21. The question of finitely many steps in polynomial ideal theory: Label: en
  22. A new proof of Hilbert's theorem on homogeneous functions: Label: en
  23. On elimination theory: Label: en
  24. Completeness of a rewrite system for proving geometric theorems using Clifford algebra: Label: en
  25. A Maple package for the decomposition of certain tensor products and restrictions of representations using crystal graphs: Label: en
  26. Symbolic computation of potential energy functions: Label: en
  27. From interval computations to modal mathematics: Label: en
  28. MPCR: Label: en
  29. GRG EC: Label: en
  30. The McCrimmon radical for identities of degree 3: Label: en
  31. Matrix eigenproblems are at the heart of polynomial system solving: Label: en
  32. Solving algebraic systems using matrix computations: Label: en
  33. Computing radical expressions for roots of unity: Label: en
  34. Resolvent and rational canonical forms of matrices: Label: en
  35. Multiple-valued complex functions and computer algebra: Label: en
  36. Why computer algebra systems sometimes can't solve simple equations: Label: en
  37. Searching symbolically for Ape´ry-like formulae for values of the Riemann zeta function: Label: en
  38. A review of symbolic solvers: Label: en
  39. Pseudo-parallel execution of modular computation: Label: en
  40. Gröbner and involutive bases for zero-dimensional ideals: Label: en
  41. Note on Kovacic's algorithm: Label: en
  42. REDUCE package for the indefinite and definite summation: Label: en
  43. Solving the load flow problem using Gröbner basis: Label: en
  44. On families of iterated derivatives: Label: en
  45. Height as a coefficient bound for univariate polynomial factors, part II: Label: en
  46. Height as a coefficient bound for univariate polynomial factors: Label: en
  47. Some human interaction issues in computer algebra: Label: en
  48. Efficient factorization of linear ODE's: Label: en
  49. A comparison of the Vaxima and Reduce factorization packages: Label: en
  50. Automatic analysis of real algebraic curves: Label: en

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