The complexity of computing exponents

DOI10.1007/BF01145475zbMath0531.03023WikidataQ125798652 ScholiaQ125798652MaRDI QIDQ787966

Sergey S. Marchenkov

Publication date: 1982

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

computational complexity; exponentiation; Kalmar's elementary function

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

03D20: Recursive functions and relations, subrecursive hierarchies

Cites Work

• Classes of Predictably Computable Functions
• Unnamed Item