The following pages link to Erich L. Kaltofen (Q412212):
Displayed 50 items.
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field (Q412213) (← links)
- (Q626683) (redirect page) (← links)
- Efficiently certifying non-integer powers (Q626685) (← links)
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients (Q654030) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← links)
- (Q1125815) (redirect page) (← links)
- Distributed matrix-free solution of large sparse linear systems over finite fields (Q1125817) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- On the complexity of computing determinants (Q1766817) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
- Effective Noether irreducibility forms and applications (Q1892221) (← links)
- Process scheduling in DSC and the large sparse linear systems challenge (Q1895417) (← links)
- Hermite rational function interpolation with error correction (Q2110229) (← links)
- On computing the degree of a Chebyshev polynomial from its value (Q2229707) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Sparse multivariate function recovery with a small number of evaluations (Q2635077) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- Symbolic Computation and Complexity Theory Transcript of My Talk (Q2799547) (← links)
- Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations (Q2799561) (← links)
- Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation (Q2819627) (← links)
- Cleaning-up data for sparse model synthesis (Q2819702) (← links)
- Numerical linear system solving with parametric entries by error correction (Q2819708) (← links)
- Error-Correcting Sparse Interpolation in the Chebyshev Basis (Q2819732) (← links)
- The “Seven Dwarfs” of Symbolic Computation (Q2912116) (← links)
- On the matrix berlekamp-massey algorithm (Q2933664) (← links)
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method (Q2946543) (← links)
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields (Q2958982) (← links)
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials (Q2958983) (← links)
- A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions (Q2959018) (← links)
- Sparse multivariate function recovery from values with noise and outlier errors (Q2963237) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Numerical Sparsity Determination and Early Termination (Q2985834) (← links)
- (Q3041304) (← links)
- (Q3105511) (← links)
- Symmetric Determinantal Representation of Weakly-Skew Circuits (Q3113718) (← links)
- A Generalized Class of Polynomials that are Hard to Factor (Q3311656) (← links)
- (Q3336683) (← links)
- (Q3447170) (← links)