Pages that link to "Item:Q2985798"
From MaRDI portal
The following pages link to Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Q2985798):
Displaying 50 items.
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Compact Formulae in Sparse Elimination (Q2985799) (← links)
- Succinct Data Structures ... Potential for Symbolic Computation? (Q2985800) (← links)
- Symbolic Summation in Difference Rings and Applications (Q2985801) (← links)
- Symbolic Computation of Parameter Integrals (Q2985802) (← links)
- Formal Algorithmic Elimination for PDEs (Q2985803) (← links)
- Detecting Similarities of Rational Space Curves (Q2985804) (← links)
- Computing Limits of Real Multivariate Rational Functions (Q2985806) (← links)
- Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test (Q2985807) (← links)
- Baby-Step Giant-Step Algorithms for the Symmetric Group (Q2985808) (← links)
- Computing the Lie Algebra of the Differential Galois Group of a Linear Differential System (Q2985809) (← links)
- Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810) (← links)
- A Superfast Randomized Algorithm to Decompose Binary Forms (Q2985811) (← links)
- Analysis of the Brun Gcd Algorithm (Q2985812) (← links)
- Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra (Q2985813) (← links)
- Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery (Q2985814) (← links)
- Computation of the Similarity Class of the p-Curvature (Q2985815) (← links)
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field (Q2985816) (← links)
- Efficient Algorithms for Mixed Creative Telscoping (Q2985817) (← links)
- GBLA (Q2985820) (← links)
- Validating the Completeness of the Real Solution Set of a System of Polynomial Equations (Q2985821) (← links)
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822) (← links)
- Division and Slope Factorization of p-Adic Polynomials (Q2985823) (← links)
- Existence Problem of Telescopers (Q2985824) (← links)
- Reduction-Based Creative Telescoping for Algebraic Functions (Q2985825) (← links)
- Critical Point Computations on Smooth Varieties (Q2985826) (← links)
- Fast Fourier Orthogonalization (Q2985827) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Selecting Algorithms for Black Box Matrices (Q2985829) (← links)
- On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830) (← links)
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems (Q2985831) (← links)
- Computer Assisted Proof for Apwenian Sequences (Q2985832) (← links)
- Bounds for Orders of Derivatives in Differential Elimination Algorithms (Q2985833) (← links)
- Numerical Sparsity Determination and Early Termination (Q2985834) (← links)
- Fast Polynomial Multiplication over F <sub>2</sub> <sub>60</sub> (Q2985835) (← links)
- A Factorization Algorithm for G-Algebras and Applications (Q2985836) (← links)
- A Fast Parallel Sparse Polynomial GCD Algorithm (Q2985837) (← links)
- New Bounds for Hypergeometric Creative Telescoping (Q2985838) (← links)
- Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields (Q2985839) (← links)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
- Computing Real Roots of Real Polynomials ... and now For Real! (Q2985841) (← links)
- Equivariant Gröbner Bases of Symmetric Toric Ideals (Q2985842) (← links)
- On p-Adic Differential Equations with Separation of Variables (Q2985843) (← links)
- Positive Root Isolation for Poly-Powers (Q2985844) (← links)
- Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables (Q2985845) (← links)
- A Fast Algorithm for Computing the Truncated Resultant (Q2985846) (← links)
- Comprehensive Gröbner Systems in Rings of Differential Operators, Holonomic D-modules and B-functions (Q2985847) (← links)
- Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic (Q2985848) (← links)
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations (Q2985849) (← links)
- Faster LLL-type Reduction of Lattice Bases (Q2985850) (← links)
