The complexity of computing exponents

DOI10.1007/BF01145475MaRDI QIDQ787966zbMATH OpenWikidataFDO

Authors S. S. Marchenkov

Publication date 1982

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityexponentiationKalmar's elementary function

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Review text

Translation from Mat. Zametki 31, No.3, 457-463 (Russian) (1982; Zbl 0508.03018).

Cites work

• Classes of Predictably Computable Functions
• scientific article; zbMATH DE number 3739841 (Why is no real title available?)

Cited in

(5)

• Exponent Recoding and Regular Exponentiation Algorithms
• On the complexity of calculating factorials
• scientific article; zbMATH DE number 1303124 (Why is no real title available?)
• An Algorithm for Computing Optimal Exponent Pairs
• Implicatively implicit extensions in three-valued logic

This page was built for publication: The complexity of computing exponents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787966)