Methodologies of Symbolic Computation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1522643
- scientific article; zbMATH DE number 4110093
- scientific article; zbMATH DE number 41264
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Software engineering and complexity in effective algebraic geometry
Cites work
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An Improved Multivariate Polynomial Factoring Algorithm
- An Inequality About Factors of Polynomials
- An LLL algorithm with quadratic complexity
- Bounds on factors in \(\mathbb Z[x]\)
- Dimension-dependent bounds for Gröbner bases of polynomial ideals
- Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials with rational coefficients
- Floating point Gröbner bases.
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- scientific article; zbMATH DE number 62660 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Modular algorithms for computing Gröbner bases.
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Hensel factorization. I
- On the Efficiency of a Polynomial Irreducibility Test
- P-adic reconstruction of rational numbers
- Polynomials whose powers are sparse
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Some Polynomial and Integer Divisibility Problems are NP-Hard
- Subresultants and Reduced Polynomial Remainder Sequences
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- What can (and can't) we do with sparse polynomials?
- Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First
Cited in
(5)- scientific article; zbMATH DE number 1597553 (Why is no real title available?)
- Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes
- scientific article; zbMATH DE number 4110093 (Why is no real title available?)
- scientific article; zbMATH DE number 45082 (Why is no real title available?)
- Symbolic computation using L-systems
This page was built for publication: Methodologies of Symbolic Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163846)
