scientific article

From MaRDI portal

Revision as of 23:11, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3947116

Jump to:navigation, search

zbMath0486.68029MaRDI QIDQ3947116

Volker Strassen

Publication date: 1981

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

zbMATH Keywords

continued fraction expansion algebraic complexity Euclid's algorithm computational complexity of polynomials Knuth-Schoenhage algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Continued fractions (11A55) Radix representation; digital problems (11A63)

Related Items (5)

Fast norm computation in smooth-degree abelian number fields ⋮ The computational complexity of a set of quadratic functions ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Lower bounds in algebraic computational complexity ⋮ Definability and fast quantifier elimination in algebraically closed fields

This page was built for publication:

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