scientific article; zbMATH DE number 1273635

From MaRDI portal

Revision as of 16:02, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4237365

Jump to:navigation, search

zbMath0920.65004MaRDI QIDQ4237365

Marek Karpinski, Dima Yu. Grigoriev

Publication date: 9 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity parallel computation interpolation algorithm partial fraction representation sparse rational functions sparse rational interpolation

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Numerical interpolation (65D05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

Computability of the additive complexity of algebraic circuits with root extracting ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Sparse interpolation of multivariate rational functions ⋮ Zero testing of \(p\)-adic and modular polynomials ⋮ Reconstructing Algebraic Functions from Mixed Data

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4237365&oldid=18130311"