Foreword

DOI10.1016/j.jsc.2020.04.006zbMath1474.68012OpenAlexW4206565738MaRDI QIDQ5918134

Erich L. Kaltofen

Publication date: 18 February 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2020.04.006

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials and the knapsack problem
• Interpolating polynomials from their values
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Factoring polynomials with rational coefficients
• Early termination in sparse interpolation algorithms
• The shifted number system for fast linear algebra on integer matrices
• Numerical Sparsity Determination and Early Termination
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
• Essentially optimal interactive certificates in linear algebra
• Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
• Solving sparse linear equations over finite fields
• The complete generating function for Gessel walks is algebraic

This page was built for publication: Foreword