Entity usage

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

1. Finding all bessel type solutions for linear differential equations with rational function coefficients: Label: en
2. A new algorithm for computing comprehensive Gröbner systems: Label: en
3. Degree bounds for Gröbner bases of low-dimensional polynomial ideals: Label: en
4. A new incremental algorithm for computing Groebner bases: Label: en
5. Symbolic integration at compile time in finite element methods: Label: en
6. Easy composition of symbolic computation software: Label: en
7. Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable: Label: en
8. An in-place truncated fourier transform and applications to polynomial multiplication: Label: en
9. Iterative Toom-Cook methods for very unbalanced long integer multiplication: Label: en
10. On some decidable and undecidable problems related to q-difference equations with parameters: Label: en
11. Solving recurrence relations using local invariants: Label: en
12. Liouvillian solutions of irreducible second order linear difference equations: Label: en
13. Yet another block Lanczos algorithm: Label: en
14. Computing specified generators of structured matrix inverses: Label: en
15. A Strassen-like matrix multiplication suited for squaring and higher power computation: Label: en
16. Output-sensitive decoding for redundant residue systems: Label: en
17. Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology: Label: en
18. Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes: Label: en
19. The DMM bound: Label: en
20. Random polynomials and expected complexity of bisection methods for real solving: Label: en
21. Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method: Label: en
22. Real and complex polynomial root-finding with eigen-solving and preprocessing: Label: en
23. Partial denominator bounds for partial linear difference equations: Label: en
24. Complexity of creative telescoping for bivariate rational functions: Label: en
25. When can we detect that a P-finite sequence is positive?: Label: en
26. Triangular decomposition of semi-algebraic systems: Label: en
27. Solving schubert problems with Littlewood-Richardson homotopies: Label: en
28. Computing the singularities of rational space curves: Label: en
29. Polynomial integration on regions defined by a triangle and a conic: Label: en
30. Blind image deconvolution via fast approximate GCD: Label: en
31. Chebyshev interpolation polynomial-based tools for rigorous computing: Label: en
32. NumGfun: Label: en
33. Decomposition of generic multivariate polynomials: Label: en
34. Composition collisions and projective polynomials: Label: en
35. A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals: Label: en
36. Global optimization of polynomials using generalized critical values and sums of squares: Label: en
37. Algorithms for Bernstein--Sato polynomials and multiplier ideals: Label: en
38. Absolute factoring of non-holonomic ideals in the plane: Label: en
39. A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra: Label: en
40. Parametric quantified SAT solving: Label: en
41. Black-box/white-box simplification and applications to quantifier elimination: Label: en
42. Computation with semialgebraic sets represented by cylindrical algebraic formulas: Label: en
43. Consistency of finite difference approximations for linear PDE systems and its algorithmic verification: Label: en
44. Simultaneously row- and column-reduced higher-order linear differential systems: Label: en