Fast exponentiation using the truncation operation

DOI10.1007/BF01272076zbMath0771.65008OpenAlexW2081862234MaRDI QIDQ2366170

Baruch Schieber, Yishay Mansour, Prasoon Tiwari, Nader H. Bshouty

Publication date: 29 June 1993

Published in: Computational Complexity (Search for Journal in Brave)

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

zbMATH Keywords

complexityexponential functionfast exponentiationtruncation operation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computation of special functions and constants, construction of tables (65D20)

Related Items (5)

A tight bound for approximating the square root ⋮ P-RAM vs. RP-RAM ⋮ On Faster Integer Calculations Using Non-arithmetic Primitives ⋮ Arbitrary sequence RAMs ⋮ Lower bounds on algebraic random access machines

Cites Work

• Unnamed Item
• Lower time bounds for integer programming with two variables
• On the limits of computations with the floor function
• On the control power of integer division
• Berechnung und Programm. I
• Lower Bounds for Computations with the Floor Operation
• Lower Bounds for Sorting with Realistic Instruction Sets
• A lower bound for integer greatest common divisor computations

This page was built for publication: Fast exponentiation using the truncation operation