Pages that link to "Item:Q2958963"

The following pages link to Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Q2958963):

Displaying 45 items.

• Implementation of Kumar's correspondence (Q2958964) (← links)
• On the summation of <bi>P</bi>-recursive sequences (Q2958965) (← links)
• Symbolic computation of multidimensional Fenchel conjugates (Q2958966) (← links)
• Low complexity algorithms for linear recurrences (Q2958967) (← links)
• Application of high-precision computing for pricing arithmetic asian options (Q2958969) (← links)
• On computing polynomial GCDs in alternate bases (Q2958970) (← links)
• Conditions for determinantal formula for resultant of a polynomial system (Q2958971) (← links)
• Solving sparse rational linear systems (Q2958972) (← links)
• Almost tight recursion tree bounds for the Descartes method (Q2958973) (← links)
• Symbolic numeric analysis of attractors in randomly generated piecewise affine models of gene networks (Q2958974) (← links)
• Succinct representation of finite abelian groups (Q2958975) (← links)
• Resolvent systems of difference polynomial ideals (Q2958976) (← links)
• Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm (Q2958977) (← links)
• Enumeration of Rota-Baxter words (Q2958978) (← links)
• Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebras (Q2958979) (← links)
• Effective real numbers in Mmxlib (Q2958980) (← links)
• Approximate radical of ideals with clusters of roots (Q2958981) (← links)
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields (Q2958982) (← links)
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials (Q2958983) (← links)
• Application of unspecified sequences in symbolic summation (Q2958984) (← links)
• Fast rational function reconstruction (Q2958986) (← links)
• An algorithm for the computation of the radical of an ideal (Q2958987) (← links)
• Solving Kaltofen's challenge on Zolotarev's approximation problem (Q2958988) (← links)
• Rank reduction of a class of pfaffian systems in two variables (Q2958989) (← links)
• Intersection of ideals with non-commutative subalgebras (Q2958990) (← links)
• A recursive method for determining the one-dimensional submodules of Laurent-Ore modules (Q2958991) (← links)
• Resultants of skewly composed polynomials (Q2958992) (← links)
• An improvement of GAP normalizer function for permutation groups (Q2958993) (← links)
• Rational simplification modulo a polynomial ideal (Q2958994) (← links)
• Complexity of the resolution of parametric systems of polynomial equations and inequations (Q2958995) (← links)
• A data structure for a uniform approach to computations with finite groups (Q2958996) (← links)
• Modular dynamic evaluation (Q2958997) (← links)
• Uniform Gröbner bases for ideals generated by polynomials with parametric exponents (Q2958998) (← links)
• Change of order for bivariate triangular sets (Q2959000) (← links)
• A quantitative Pólya's Theorem with corner zeros (Q2959001) (← links)
• Computation of the splitting field of a dihedral polynomial (Q2959002) (← links)
• A note on implicitization and normal parametrization of rational curves (Q2959004) (← links)
• Locating real multiple zeros of a real interval polynomial (Q2959005) (← links)
• Abstract matrices in symbolic computation (Q2959006) (← links)
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases (Q2959007) (← links)
• A block Wiedemann rank algorithm (Q2959008) (← links)
• Surface parametrisation without diagonalisation (Q2959009) (← links)
• Application of numerical algebraic geometry and numerical linear algebra to PDE (Q2959010) (← links)
• Gröbner bases in difference-differential modules (Q2959011) (← links)
• Symbolic-numeric sparse interpolation of multivariate polynomials (Q5892266) (← links)