Pages that link to "Item:Q5119914"

The following pages link to Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Q5119914):

Displaying 50 items.

• Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
• On the Extended Hensel Construction and its Application to the Computation of Limit Points (Q5119915) (← links)
• An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant Components (Q5119917) (← links)
• Rational Points on the Unit Sphere (Q5119919) (← links)
• Irreducibility and Deterministic r-th Root Finding over Finite Fields (Q5119920) (← links)
• A Case Study on the Parametric Occurrence of Multiple Steady States (Q5119921) (← links)
• Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition (Q5119922) (← links)
• The Complexity of an Adaptive Subdivision Method for Approximating Real Curves (Q5119923) (← links)
• Discriminants of Complete Intersection Space Curves (Q5119924) (← links)
• Fast Multiplication for Skew Polynomials (Q5119925) (← links)
• Big Prime Field FFT on the GPU (Q5119926) (← links)
• Criteria for Finite Difference Gröbner Bases of Normal Binomial Difference Ideals (Q5119927) (← links)
• Linear Time Fourier Transforms of <i> S _n-k </i> -invariant Functions on the Symmetric Group <i> S _n </i> (Q5119928) (← links)
• Gcd Modulo a Primary Triangular Set of Dimension Zero (Q5119929) (← links)
• Calculating the Power Residue Symbol and Ibeta (Q5119930) (← links)
• Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits (Q5119931) (← links)
• Certificates for Triangular Equivalence and Rank Profiles (Q5119932) (← links)
• On Signature-Based Gröbner Bases Over Euclidean Rings (Q5119933) (← links)
• Matrix Representations by Means of Interpolation (Q5119934) (← links)
• Nemo/Hecke (Q5119935) (← links)
• Parametrizations for Families of ECM-Friendly Curves (Q5119936) (← links)
• An Algebraic-Geometric Method for Computing Zolotarev Polynomials (Q5119937) (← links)
• Computing the Nearest Rank-Deficient Matrix Polynomial (Q5119938) (← links)
• Dimension-Dependent Upper Bounds for Gröbner Bases (Q5119939) (← links)
• A Constructive Approach to Arithmetics in Ore Localizations (Q5119940) (← links)
• Algorithms for Structured Linear Systems Solving and Their Implementation (Q5119941) (← links)
• Formula Simplification for Real Quantifier Elimination Using Geometric Invariance (Q5119942) (← links)
• Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences (Q5119943) (← links)
• Efficiently Computing Real Roots of Sparse Polynomials (Q5119944) (← links)
• Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction (Q5119946) (← links)
• Bounds for Substituting Algebraic Functions into D-finite Functions (Q5119947) (← links)
• Popov Form Computation for Matrices of Ore Polynomials (Q5119948) (← links)
• The Truncated Fourier Transform for Mixed Radices (Q5119949) (← links)
• Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension (Q5119950) (← links)
• A New Algorithm for General Factorizations of Multivariate Polynomial Matrices (Q5119951) (← links)
• Algorithmic Verification of Linearizability for Ordinary Differential Equations (Q5119952) (← links)
• M4GB (Q5119953) (← links)
• Sparse Rational Univariate Representation (Q5119954) (← links)
• Resultants and Discriminants for Bivariate Tensor-Product Polynomials (Q5119955) (← links)
• Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K (Q5119957) (← links)
• Fast Algorithm for Border Bases of Artinian Gorenstein Algebras (Q5119958) (← links)
• Parametric Greatest Common Divisors using Comprehensive Gröbner Systems (Q5119959) (← links)
• Fast Computation of the Roots of Polynomials Over the Ring of Power Series (Q5119960) (← links)
• Computing Canonical Bases of Modules of Univariate Relations (Q5119962) (← links)
• Exploring the Dynamic Buchberger Algorithm (Q5119963) (← links)
• Growth in Varieties of Multioperator Algebras and Groebner Bases in Operads (Q5119964) (← links)
• Improved Bounds on Absolute Positiveness of Multivariate Polynomials (Q5119965) (← links)
• Characteristic Polynomials of p-adic Matrices (Q5119966) (← links)
• Two Fast Parallel GCD Algorithms of Many Integers (Q5119967) (← links)
• Factorization of Polynomials over Z/(p ⁿ ) (Q5119968) (← links)