Elimination of recursive calls using a small table of “randomly” selected function values

DOI10.1007/BF01940778zbMath0321.68017OpenAlexW2071041848MaRDI QIDQ4082991

J. Hilden

Publication date: 1976

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01940778

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (2)

An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ Efficient memo-table management strategies

Uses Software

• AS 55

Cites Work

• Significance Probabilities of the Wilcoxon Test

This page was built for publication: Elimination of recursive calls using a small table of “randomly” selected function values