关于使用非算术基元的更快的递归计算
On Faster Integer Calculations using Non-Arithmetic Primitives
摘要：
单位成本模型对于描述（+，*）上的整数决策算法既方便又很现实。额外的运算，如带余数的除法或按位合取，虽然同样受到计算硬件的支持，但可能会导致复杂性的显著下降。我们展示了各种具体的问题，受益于这种非算术原语提出和分析相应的快速算法。
英文摘要：
The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware, may lead to a considerable drop in complexity. We show a variety of concrete problems to benefit from such NON-arithmetic primitives by presenting and analyzing corresponding fast algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
