Pages that link to "Item:Q2802384"

The following pages link to ACM Communications in Computer Algebra (Q2802384):

Displaying 50 items.

• Bit complexity for critical point computation in smooth and compact real hypersurfaces (Q5060831) (← links)
• A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications (Q5060832) (← links)
• Algebraic approach to chaos induced by snapback repeller (Q5060833) (← links)
• Why you should remove zeros from data before guessing (Q5060834) (← links)
• Robust computation methods for sparse interpolation of multivariate polynomials (Q5060836) (← links)
• Block distance invariant method for monoterm canonicalization of Riemann tensor polynomials (Q5060837) (← links)
• Lazard's CAD exploiting equality constraints (Q5060838) (← links)
• New bivariate Hensel lifting algorithm for <i>n</i> factors (Q5060840) (← links)
• Algebraic algorithms for the reliability analysis of multi-state <i>k</i> -out-of- <i>n</i> systems (Q5060841) (← links)
• Fast algorithm for factoring difference operators (Q5060842) (← links)
• A call to build a publicly accessible library of lecture recordings in computer algebra (Q5101994) (← links)
• Algorithms for quadratic forms over global function fields of odd characteristic (Q5101995) (← links)
• Computing the ideals of sumset semigroups (Q5101996) (← links)
• Approximate greatest common divisor of several polynomials from Hankel matrices (Q5101998) (← links)
• Large final polynomials from integer programming (Q5101999) (← links)
• Constructing new spectral systems from simplicial fibrations (Q5102000) (← links)
• High-performance symbolic-numerics via multiple dispatch (Q5102005) (← links)
• Approximate GCD by relaxed NewtonSLRA algorithm (Q5102006) (← links)
• Cellular reductions of the Pommaret-Seiler resolution for Quasi-stable ideals (Q5102007) (← links)
• The DEWCAD project (Q5102008) (← links)
• Discovering multiple polylogarithm equations via symbolic computations (Q5102010) (← links)
• 22nd Workshop on Computer Algebra in Memory of Professor Vladimir Gerdt in Dubna (Q5102012) (← links)
• The fourth conference "computer algebra" in Moscow (Q5102013) (← links)
• Automated reasoning tools in GeoGebra discovery (Q5102014) (← links)
• A sage package for the symbolic-numeric factorization of linear differential operators (Q5102016) (← links)
• Maple application for structural identifiability analysis of ODE models (Q5102017) (← links)
• An extension of the fpLLL library to Hermitian lattices (Q5102018) (← links)
• Vladimir Gerdt dies at 73 (Q5102019) (← links)
• On sparse interpolation of rational functions and gcds (Q5102020) (← links)
• Checkpoints in searching for rational solutions of linear ordinary difference and differential systems (Q5102021) (← links)
• The Sage package comb_walks for walks in the quarter plane (Q5102022) (← links)
• MultiRegeneration for polynomial system solving (Q5102025) (← links)
• Algebraic optimization degree (Q5102027) (← links)
• PTOPO (Q5102028) (← links)
• CQF Magma package (Q5102029) (← links)
• A new Kenzo module for computing the Eilenberg-Moore spectral sequence (Q5102030) (← links)
• Computing one billion roots using the tangent Graeffe method (Q5102031) (← links)
• A complexity chasm for solving sparse polynomial equations over <i>p</i> -adic fields (Q5102032) (← links)
• A calculus for monomials in Chow group of zero cycles in the moduli space of stable curves (Q5102034) (← links)
• Improved divisor arithmetic on generic hyperelliptic curves (Q5102035) (← links)
• Exploiting symmetry in the power flow equations using monodromy (Q5102037) (← links)
• Smooth points on semi-algebraic sets (Q5102038) (← links)
• Towards fast one-block quantifier elimination through generalised critical values (Q5102039) (← links)
• Sampling the feasible sets of SDPs and volume approximation (Q5102040) (← links)
• Optimal monomial quadratization for ODE systems (Q5102041) (← links)
• A note on sparse polynomial interpolation in Dickson polynomial basis (Q5102042) (← links)
• Combinatorial primality test (Q5102043) (← links)
• Linear differential, difference and <i>q</i> -difference homogeneous equations having no rational solutions (Q5175235) (← links)
• An efficient algorithm for checking hyper-regularity of matrices (Q5175236) (← links)
• A fast recursive algorithm for computing cyclotomic polynomials (Q5175237) (← links)