Minimum times and memories needed to compute the values of a function

DOI10.1016/S0022-0000(74)80007-3zbMath0293.68042MaRDI QIDQ1212358

Peter Eliaš

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Complexity of acceptors for prefix codes (Corresp.)
• Efficient Storage and Retrieval by Content and Address of Static Files
• An upper bound on the entropy series
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum times and memories needed to compute the values of a function