The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by several algebraic manipulation systems, it has not been examined critically in the literature. While the use of tabulation or "memoization" seems to be a particularly simple and worthwhile technique in some areas, there are some negative consequences. Furthermore, the expansion of this technique to other areas (other than recurrences) has not been subjected to analysis.
rnThis paper examines some of the assumptions. A more detailed technical report [9] is under preparation.
使用查找表可以降低通常由数学递归关系定义的函数的计算复杂性。尽管该技术已被几种代数运算系统采用,但在文献中并未对其进行严格的检查。尽管在某些领域中使用制表或“记忆化”似乎是一种特别简单且值得的技术,但仍会带来一些负面影响。此外,尚未对该技术扩展到其他领域(复发除外)进行分析。 P> rn
本文研究了一些假设。正在准备更详细的技术报告[9]。 P>
University of California, Berkeley;
机译:非常低复杂性过滤器查找表设计,具有非均匀间距的SOA线性化
机译:用于设计几乎最佳的查找表以控制H.264编码器的复杂度的快速算法-Springer
机译:基于查找表的递延迭代辅助的低复杂度Turbo混合ARQ
机译:通过查表VQ和索引编码的低复杂度可伸缩视频编码
机译:使用查找表的全同态加密在云中保护隐私的计算
机译:基于双k矢量查找表的快速星匹配方法用于多曝光明星跟踪器
机译:基于查找表的延期迭代辅助低复杂性涡轮增压架arq