Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
From MaRDI portal
Publication:1581129
DOI10.1006/jsco.2000.0370zbMath0963.68234OpenAlexW2127412655MaRDI QIDQ1581129
Publication date: 21 June 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0370
Related Items
An explicit radical parametrization of Zolotarev polynomials of degree 7 in terms of nested square roots, Efficient matrix preconditioners for black box linear algebra, Polynomial evaluation and interpolation on special sets of points, Numerical factorization of multivariate complex polynomials, Modular composition modulo triangular sets and applications, Elimination ideal and bivariate resultant over finite fields, Fast arithmetics in Artin-Schreier towers over finite fields, Computing monodromy via continuation methods on random Riemann surfaces, Fast computation of special resultants, A complete algorithm to find exact minimal polynomial by approximations, The numerical factorization of polynomials, Regularization and Matrix Computation in Numerical Polynomial Algebra, Approximate factorization of multivariate polynomials using singular value decomposition, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, On the complexities of multipoint evaluation and interpolation, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalised characteristic polynomials
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Quasi-gcd computations
- On Lovász' lattice reduction and the nearest lattice point problem
- Résolution des systèmes d'équations algébriques
- Factoring polynomials with rational coefficients
- Composing power series over a finite ring in essentially linear time
- Nearest singular polynomials
- Symbolic integration. I: Transcendental functions
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Certified approximate univariate GCDs
- Advances in Cryptology -- CRYPTO '97. 17th annual international cryptology conference. Santa Barbara, CA, USA. August 17--21, 1997. Proceedings
- Rectifying transformations for the integration of rational trigonometric functions
- Floating point Gröbner bases.
- Checking robust nonsingularity is NP-hard
- Effective Noether irreducibility forms and applications
- A new polynomial factorization algorithm and its implementation
- Computing Frobenius maps and factoring polynomials
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- On the rapid computation of various polylogarithmic constants
- A method for overlapping and erasure of lists
- An elementary proof of Kharitonov's stability theorem with extensions
- Solving sparse linear equations over finite fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Addition requirements for matrix and transposed matrix products
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Multivariate Polynomial Factorization
- Factoring Polynomials Over Algebraic Number Fields
- Euclid’s algorithm and the Lanczos method over finite fields
- The evaluation of trigonometric integrals avoiding spurious discontinuities
- Subquadratic-time factoring of polynomials over finite fields
- The Importance of Being Continuous
- On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
- Shift-register synthesis and BCH decoding
- The Problem of Integration in Finite Terms
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Numerical Linear Algebra
- Factoring Polynomials Over Large Finite Fields
- Fast construction of irreducible polynomials over finite fields
