Pages that link to "Item:Q2802384"
From MaRDI portal
The following pages link to ACM Communications in Computer Algebra (Q2802384):
Displaying 50 items.
- Sparse polynomials in FLINT (Q5270202) (← links)
- Motion polynomials and planar linkages (Q5270203) (← links)
- Polynomial homotopy continuation in Macaulay2 (Q5270204) (← links)
- SLV (Q5270205) (← links)
- Review of "Pavel pech: selected topics in geometry with classical vs. computer proving by Pavel Pech", World Scientific 2007 ISBN-10: 981-270-942-8, ISBN-13: 978-981-270-942-4 (Q5270502) (← links)
- Branch cuts in maple 17 (Q5270639) (← links)
- Abstracts of the 2014 east coast computer algebra day (Q5270641) (← links)
- Kolchin seminar in differential algebra (Q5270642) (← links)
- The Kolchin seminar in differential algebra at the graduate center of the city university of New York (Q5270643) (← links)
- Noether resolutions in dimension 2 (Q5880523) (← links)
- Computing isomorphisms and embeddings of finite fields (Q5880524) (← links)
- Gröbner bases and multi-dimensional persistent bifurcation diagram classifications (Q5880525) (← links)
- Sparse FGLM using the block Wiedemann algorithm (Q5880526) (← links)
- Computing the integer points of a polyhedron (Q5880527) (← links)
- Isogeny-based cryptography in Julia/Nemo (Q5880528) (← links)
- On computing residue integrals for a class of nonlinear transcendental systems (Q5880529) (← links)
- Computing noncommutative Hilbert series (Q5880530) (← links)
- Symbolic computation with monotone operators (Q5880531) (← links)
- On W-characteristic sets of lexicographic Gröbner bases (Q5880532) (← links)
- Robust algorithms for sparse interpolation of multivariate polynomials (Q5880533) (← links)
- Improvement of EZ-GCD algorithm based on extended hensel construction (Q5880534) (← links)
- Computation of geometric Galois groups and absolute factorizations (Q5880535) (← links)
- Revisiting Gilbert Strang's "a chaotic search for <i>i</i> " (Q5880536) (← links)
- Row reduction process for matrices of scalar operators (Q5880537) (← links)
- ISSAC 2019 software presentations communicated by Yue Ren (Q5880538) (← links)
- SIAN (Q5880539) (← links)
- Computing generic bivariate Gröbner bases with Mathemagix (Q5880540) (← links)
- Certifying approximate solutions to polynomial systems on Macaulay2 (Q5880541) (← links)
- Certifying operator identities via noncommutative Gröbner bases (Q5880542) (← links)
- A sage implementation for DD-finite functions (Q5880543) (← links)
- Multivariate ore polynomials in SageMath (Q5880544) (← links)
- A Kenzo interface for algebraic topology computations in SageMath (Q5880545) (← links)
- The conference "computer algebra" in Moscow (Q5880546) (← links)
- Computing generalized hamming weights of binary linear codes via free resolutions (Q6110892) (← links)
- An identity on multinomial coefficients (Q6110906) (← links)
- Adaptive Thiele interpolation (Q6110917) (← links)
- Algorithms for quadratic forms over global function fields (Q6536537) (← links)
- Linear difference operators with sequence coefficients having infinite-dimentional solution spaces (Q6536538) (← links)
- Marko Petkovšek 1955--2023 (Q6536540) (← links)
- Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields (Q6536542) (← links)
- Computing Mellin representations and asymptotics of nested binomial sums in a symbolic way: the Rica package (Q6536544) (← links)
- Modular matrix multiplication on GPU for polynomial system solving (Q6536546) (← links)
- MSSM: a Macaulay2 package for the vacuum moduli space (Q6536547) (← links)
- Faithful real-time animation of parametrized (semi-) algebraic expressions via cylindrical algebraic decomposition (Q6536548) (← links)
- Effective homology of universal covers (Q6536549) (← links)
- Operations for D-algebraic functions (Q6536550) (← links)
- FFCSA - finite field constructions, search, and algorithms (Q6536551) (← links)
- The fifth conference ``Computer algebra'' in Moscow (Q6536553) (← links)
- The Keiper-Li criterion for the Riemann hypothesis and generalized Lambert functions (Q6536595) (← links)
- Computing almost-commuting basis of ordinary differential operators (Q6536596) (← links)