Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129): Difference between revisions

Latest revision as of 13:02, 30 May 2024

scientific article

Language	Label	Description	Also known as
English	Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey	scientific article

Statements

instance of

scholarly article

0 references

title

Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (English)

0 references

published in

Journal of Symbolic Computation

0 references

publication date

21 June 2001

0 references

zbMATH Keywords

symbolic mathematical computation

0 references

author

Erich L. Kaltofen

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1006/jsco.2000.0370

0 references

cites work

Q3235904

0 references

Q4526993

0 references

On Lovász' lattice reduction and the nearest lattice point problem

0 references

On the rapid computation of various polylogarithmic constants

0 references

Q4693774

0 references

Factoring Polynomials Over Large Finite Fields

0 references

Composing power series over a finite ring in essentially linear time

0 references

Fast solution of toeplitz systems of equations and computation of Padé approximants

0 references

Symbolic integration. I: Transcendental functions

0 references

On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

0 references

On Euclid's Algorithm and the Theory of Subresultants

0 references

Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems

0 references

Q3714165

0 references

Q4331740

0 references

Generalised characteristic polynomials

0 references

Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993

0 references

A method for overlapping and erasure of lists

0 references

Q5690494

0 references

Q4234320

0 references

Certified approximate univariate GCDs

0 references

On Obtaining Upper Bounds on the Complexity of Matrix Multiplication

0 references

Q3261425

0 references

Q4248250

0 references

Computing Frobenius maps and factoring polynomials

0 references

Q4223150

0 references

Q5689624

0 references

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers

0 references

Q4223151

0 references

Q4225790

0 references

The Importance of Being Continuous

0 references

Rectifying transformations for the integration of rational trigonometric functions

0 references

The evaluation of trigonometric integrals avoiding spurious discontinuities

0 references

Q4023355

0 references

Numerical Linear Algebra

0 references

Advances in Cryptology -- CRYPTO '97. 17th annual international cryptology conference. Santa Barbara, CA, USA. August 17--21, 1997. Proceedings

0 references

Effective Noether irreducibility forms and applications

0 references

Subquadratic-time factoring of polynomials over finite fields

0 references

Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

0 references

Addition requirements for matrix and transposed matrix products

0 references

Q4398780

0 references

Q3675135

0 references

Résolution des systèmes d'équations algébriques

0 references

Factoring Multivariate Polynomials over Algebraic Number Fields

0 references

Factoring polynomials with rational coefficients

0 references

Q4223144

0 references

Q3697106

0 references

Q4293528

0 references

Shift-register synthesis and BCH decoding

0 references

An elementary proof of Kharitonov's stability theorem with extensions

0 references

Multivariate Polynomial Factorization

0 references

Checking robust nonsingularity is NP-hard

0 references

The Problem of Integration in Finite Terms

0 references

Quasi-gcd computations

0 references

Floating point Gröbner bases.

0 references

Fast construction of irreducible polynomials over finite fields

0 references

A new polynomial factorization algorithm and its implementation

0 references

Euclid’s algorithm and the Lanczos method over finite fields

0 references

Q4234279

0 references

Factoring Polynomials Over Algebraic Number Fields

0 references

Solving sparse linear equations over finite fields

0 references

Nearest singular polynomials

0 references

Identifiers

zbMATH Open document ID

0963.68234

0 references

DOI

10.1006/jsco.2000.0370

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1581129

@@ Property / describes a project that uses @@
+Mathematica
@@ Property / describes a project that uses: Mathematica / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+REDUCE
@@ Property / describes a project that uses: REDUCE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MACSYMA
@@ Property / describes a project that uses: MACSYMA / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jsco.2000.0370
+Normal rank
@@ Property / OpenAlex ID @@
+W2127412655
@@ Property / OpenAlex ID: W2127412655 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3235904
@@ Property / cites work: Q3235904 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+On Lovász' lattice reduction and the nearest lattice point problem
+Normal rank
@@ Property / cites work @@
+On the rapid computation of various polylogarithmic constants
+Normal rank
@@ Property / cites work @@
+Q4693774
@@ Property / cites work: Q4693774 / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring Polynomials Over Large Finite Fields
@@ Property / cites work: Factoring Polynomials Over Large Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Composing power series over a finite ring in essentially linear time
+Normal rank
@@ Property / cites work @@
+Fast solution of toeplitz systems of equations and computation of Padé approximants
+Normal rank
@@ Property / cites work @@
+Symbolic integration. I: Transcendental functions
@@ Property / cites work: Symbolic integration. I: Transcendental functions / rank @@
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Theory of Subresultants
+Normal rank
@@ Property / cites work @@
+Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
+Normal rank
@@ Property / cites work @@
+Q3714165
@@ Property / cites work: Q3714165 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalised characteristic polynomials
@@ Property / cites work: Generalised characteristic polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
+Normal rank
@@ Property / cites work @@
+A method for overlapping and erasure of lists
@@ Property / cites work: A method for overlapping and erasure of lists / rank @@
+Normal rank
@@ Property / cites work @@
+Q5690494
@@ Property / cites work: Q5690494 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234320
@@ Property / cites work: Q4234320 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Q3261425
@@ Property / cites work: Q3261425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Frobenius maps and factoring polynomials
+Normal rank
@@ Property / cites work @@
+Q4223150
@@ Property / cites work: Q4223150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
+Normal rank
@@ Property / cites work @@
+Q4223151
@@ Property / cites work: Q4223151 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225790
@@ Property / cites work: Q4225790 / rank @@
+Normal rank
@@ Property / cites work @@
+The Importance of Being Continuous
@@ Property / cites work: The Importance of Being Continuous / rank @@
+Normal rank
@@ Property / cites work @@
+Rectifying transformations for the integration of rational trigonometric functions
+Normal rank
@@ Property / cites work @@
+The evaluation of trigonometric integrals avoiding spurious discontinuities
+Normal rank
@@ Property / cites work @@
+Q4023355
@@ Property / cites work: Q4023355 / rank @@
+Normal rank
@@ Property / cites work @@
+Numerical Linear Algebra
@@ Property / cites work: Numerical Linear Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology -- CRYPTO '97. 17th annual international cryptology conference. Santa Barbara, CA, USA. August 17--21, 1997. Proceedings
+Normal rank
@@ Property / cites work @@
+Effective Noether irreducibility forms and applications
+Normal rank
@@ Property / cites work @@
+Subquadratic-time factoring of polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
+Normal rank
@@ Property / cites work @@
+Addition requirements for matrix and transposed matrix products
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3675135
@@ Property / cites work: Q3675135 / rank @@
+Normal rank
@@ Property / cites work @@
+Résolution des systèmes d'équations algébriques
+Normal rank
@@ Property / cites work @@
+Factoring Multivariate Polynomials over Algebraic Number Fields
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223144
@@ Property / cites work: Q4223144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3697106
@@ Property / cites work: Q3697106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4293528
@@ Property / cites work: Q4293528 / rank @@
+Normal rank
@@ Property / cites work @@
+Shift-register synthesis and BCH decoding
@@ Property / cites work: Shift-register synthesis and BCH decoding / rank @@
+Normal rank
@@ Property / cites work @@
+An elementary proof of Kharitonov's stability theorem with extensions
+Normal rank
@@ Property / cites work @@
+Multivariate Polynomial Factorization
@@ Property / cites work: Multivariate Polynomial Factorization / rank @@
+Normal rank
@@ Property / cites work @@
+Checking robust nonsingularity is NP-hard
@@ Property / cites work: Checking robust nonsingularity is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+The Problem of Integration in Finite Terms
@@ Property / cites work: The Problem of Integration in Finite Terms / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Floating point Gröbner bases.
@@ Property / cites work: Floating point Gröbner bases. / rank @@
+Normal rank
@@ Property / cites work @@
+Fast construction of irreducible polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+A new polynomial factorization algorithm and its implementation
+Normal rank
@@ Property / cites work @@
+Euclid’s algorithm and the Lanczos method over finite fields
+Normal rank
@@ Property / cites work @@
+Q4234279
@@ Property / cites work: Q4234279 / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring Polynomials Over Algebraic Number Fields
+Normal rank
@@ Property / cites work @@
+Solving sparse linear equations over finite fields
+Normal rank
@@ Property / cites work @@
+Nearest singular polynomials
@@ Property / cites work: Nearest singular polynomials / rank @@
+Normal rank