Pages that link to "Item:Q2946514"

The following pages link to Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Q2946514):

Displaying 44 items.

• A new incremental algorithm for computing Groebner bases (Q2946515) (← links)
• Degree bounds for Gröbner bases of low-dimensional polynomial ideals (Q2946516) (← links)
• A new algorithm for computing comprehensive Gröbner systems (Q2946517) (← links)
• Finding all bessel type solutions for linear differential equations with rational function coefficients (Q2946518) (← links)
• Simultaneously row- and column-reduced higher-order linear differential systems (Q2946519) (← links)
• Consistency of finite difference approximations for linear PDE systems and its algorithmic verification (Q2946520) (← links)
• Computation with semialgebraic sets represented by cylindrical algebraic formulas (Q2946521) (← links)
• Black-box/white-box simplification and applications to quantifier elimination (Q2946522) (← links)
• Parametric quantified SAT solving (Q2946524) (← links)
• A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra (Q2946525) (← links)
• Absolute factoring of non-holonomic ideals in the plane (Q2946526) (← links)
• Algorithms for Bernstein--Sato polynomials and multiplier ideals (Q2946527) (← links)
• Global optimization of polynomials using generalized critical values and sums of squares (Q2946528) (← links)
• A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals (Q2946529) (← links)
• Composition collisions and projective polynomials (Q2946530) (← links)
• Decomposition of generic multivariate polynomials (Q2946531) (← links)
• NumGfun (Q2946532) (← links)
• Chebyshev interpolation polynomial-based tools for rigorous computing (Q2946533) (← links)
• Blind image deconvolution via fast approximate GCD (Q2946534) (← links)
• Polynomial integration on regions defined by a triangle and a conic (Q2946535) (← links)
• Computing the singularities of rational space curves (Q2946536) (← links)
• Solving schubert problems with Littlewood-Richardson homotopies (Q2946537) (← links)
• When can we detect that a P-finite sequence is positive? (Q2946538) (← links)
• Complexity of creative telescoping for bivariate rational functions (Q2946539) (← links)
• Partial denominator bounds for partial linear difference equations (Q2946540) (← links)
• Real and complex polynomial root-finding with eigen-solving and preprocessing (Q2946541) (← links)
• Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method (Q2946543) (← links)
• Random polynomials and expected complexity of bisection methods for real solving (Q2946544) (← links)
• The DMM bound (Q2946545) (← links)
• Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes (Q2946546) (← links)
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology (Q2946547) (← links)
• Output-sensitive decoding for redundant residue systems (Q2946549) (← links)
• A Strassen-like matrix multiplication suited for squaring and higher power computation (Q2946550) (← links)
• Computing specified generators of structured matrix inverses (Q2946552) (← links)
• Yet another block Lanczos algorithm (Q2946553) (← links)
• Liouvillian solutions of irreducible second order linear difference equations (Q2946555) (← links)
• Solving recurrence relations using local invariants (Q2946556) (← links)
• On some decidable and undecidable problems related to q-difference equations with parameters (Q2946557) (← links)
• Iterative Toom-Cook methods for very unbalanced long integer multiplication (Q2946558) (← links)
• An in-place truncated fourier transform and applications to polynomial multiplication (Q2946559) (← links)
• Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560) (← links)
• Easy composition of symbolic computation software (Q2946562) (← links)
• Symbolic integration at compile time in finite element methods (Q2946563) (← links)
• Triangular decomposition of semi-algebraic systems (Q5892166) (← links)