Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Erich L. Kaltofen - MaRDI portal

Erich L. Kaltofen

From MaRDI portal
(Redirected from Person:626683)
Person:412212

Available identifiers

zbMath Open kaltofen.erich-lDBLPk/ErichKaltofenWikidataQ95272336 ScholiaQ95272336MaRDI QIDQ412212

List of research outcomes

PublicationDate of PublicationType
Hermite rational function interpolation with error correction2022-12-21Paper
A note on sparse polynomial interpolation in Dickson polynomial basis2022-09-06Paper
A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields2022-04-06Paper
Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding2021-02-22Paper
Foreword2021-02-18Paper
On computing the degree of a Chebyshev polynomial from its value2021-02-18Paper
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits2020-09-09Paper
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction2020-09-09Paper
Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases2020-09-09Paper
Computing approximate greatest common right divisors of differential polynomials2020-04-01Paper
Elimination-based certificates for triangular equivalence and rank profiles2020-01-15Paper
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix2017-05-10Paper
Numerical Sparsity Determination and Early Termination2017-05-10Paper
Sparse multivariate function recovery from values with noise and outlier errors2017-02-10Paper
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields2017-02-03Paper
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials2017-02-03Paper
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions2017-02-03Paper
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation2016-09-29Paper
Cleaning-up data for sparse model synthesis2016-09-29Paper
Numerical linear system solving with parametric entries by error correction2016-09-29Paper
Error-Correcting Sparse Interpolation in the Chebyshev Basis2016-09-29Paper
Symbolic Computation and Complexity Theory Transcript of My Talk2016-04-12Paper
Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations2016-04-12Paper
Sparse multivariate function recovery with a small number of evaluations2016-02-11Paper
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm2015-11-26Paper
Essentially optimal interactive certificates in linear algebra2015-11-11Paper
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance2015-11-11Paper
Sparse multivariate function recovery with a high error rate in the evaluations2015-11-11Paper
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method2015-09-17Paper
On the complexity of factoring bivariate supersparse (Lacunary) polynomials2015-07-16Paper
Generic matrix multiplication and memory management in linBox2015-07-16Paper
Quadratic-time certificates in linear algebra2015-06-09Paper
Supersparse black box rational function interpolation2015-06-09Paper
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values2015-03-27Paper
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions2015-03-27Paper
Irreducible polynomials and barker sequences2015-02-24Paper
On the matrix berlekamp-massey algorithm2014-12-05Paper
A fraction free matrix Berlekamp/Massey algorithm2014-02-19Paper
The “Seven Dwarfs” of Symbolic Computation2012-09-14Paper
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field2012-05-04Paper
Symmetric Determinantal Representation of Weakly-Skew Circuits2012-01-23Paper
https://portal.mardi4nfdi.de/entity/Q31055112012-01-05Paper
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients2011-12-21Paper
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices2011-04-16Paper
Efficiently certifying non-integer powers2011-02-18Paper
Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares2010-07-30Paper
Expressing a fraction of two determinants as a determinant2009-01-20Paper
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars2009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q53016712009-01-20Paper
Approximate factorization of multivariate polynomials using singular value decomposition2008-04-23Paper
Deterministic distinct-degree factorization of polynomials over finite fields2007-08-24Paper
https://portal.mardi4nfdi.de/entity/Q34471702007-06-28Paper
https://portal.mardi4nfdi.de/entity/Q46606372005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46606632005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46606912005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46606962005-04-04Paper
Approximate factorization of multivariate polynomials via differential equations2005-03-14Paper
On the complexity of computing determinants2005-03-01Paper
Early termination in sparse interpolation algorithms2004-08-20Paper
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases2004-08-20Paper
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.2004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q45507852003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47904342003-01-28Paper
Efficient matrix preconditioners for black box linear algebra2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q42342622002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q42342902002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q42343272002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q42284462002-01-21Paper
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey2001-06-21Paper
Distributed matrix-free solution of large sparse linear systems over finite fields2000-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42340881999-09-29Paper
https://portal.mardi4nfdi.de/entity/Q42269601999-09-10Paper
https://portal.mardi4nfdi.de/entity/Q42269591999-08-05Paper
https://portal.mardi4nfdi.de/entity/Q42325041999-08-05Paper
https://portal.mardi4nfdi.de/entity/Q42273491999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42273531999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42324691999-03-15Paper
https://portal.mardi4nfdi.de/entity/Q42273011999-02-23Paper
Subquadratic-time factoring of polynomials over finite fields1998-06-14Paper
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems1995-09-07Paper
Process scheduling in DSC and the large sparse linear systems challenge1995-08-16Paper
Effective Noether irreducibility forms and applications1995-07-13Paper
Integer division in residue number systems1995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42795171994-12-04Paper
https://portal.mardi4nfdi.de/entity/Q40387371993-05-18Paper
On fast multiplication of polynomials over arbitrary algebras1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39765051992-06-26Paper
Computing the irreducible real factors and components of an algebraic curve1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39719841992-06-25Paper
Dagwood1992-06-25Paper
Parallel algorithms for matrix normal forms1990-01-01Paper
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators1990-01-01Paper
Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields1989-01-01Paper
Greatest common divisors of polynomials given by straight-line programs1988-01-01Paper
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits1988-01-01Paper
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving1988-01-01Paper
Deterministic irreducibility testing of polynomials over large finite fields1987-01-01Paper
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37273841986-01-01Paper
Factoring sparse multivariate polynomials1985-01-01Paper
Fast parallel absolute irreducibility testing1985-01-01Paper
Effective Hilbert irreducibility1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37280911985-01-01Paper
Factorization of Multivariate Polynomials Over Finite Fields1985-01-01Paper
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433821985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37064951984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37080891984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37088791984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30413041983-01-01Paper
A Generalized Class of Polynomials that are Hard to Factor1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33366831983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36688711982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337371981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Erich L. Kaltofen