On the decidability of sparse univariate polynomial interpolation
From MaRDI portal
Publication:685722
DOI10.1007/BF01200058zbMath0774.68067OpenAlexW2026956769MaRDI QIDQ685722
Publication date: 10 October 1993
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200058
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, Reconstruction algorithms for sums of affine powers, On interpolating arithmetic read-once formulas with exponentiation, Black box interpolation. II: The one variable derogatory case.
Cites Work