ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
From MaRDI portal
Publication:5584335
DOI10.1073/pnas.58.5.1840zbMath0189.47902OpenAlexW2078644732WikidataQ36453683 ScholiaQ36453683MaRDI QIDQ5584335
Publication date: 1967
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.58.5.1840
Related Items (7)
Fast matrix multiplication and its algebraic neighbourhood ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation ⋮ Heuristic search viewed as path finding in a graph ⋮ On multiplication of 2 \(\times\) 2 matrices ⋮ Optimal algorithms for parallel polynomial evaluation ⋮ Lower bounds for dynamic algebraic problems
This page was built for publication: ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
