The complexity of computing exponents

From MaRDI portal

Revision as of 11:04, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:787966

Jump to:navigation, search

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

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

Cites Work

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:787966&oldid=12712301"