On efficiency of notations for natural numbers

DOI10.1016/J.TCS.2022.02.015MaRDI QIDQ2143116zbMATH OpenOpenAlexFDO

Authors Konrad Zdanowski

Publication date 31 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.02.015

zbMATH Keywords

complexitynatural numbersnotationspolynomial time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Notations for exponentiation.
• Representations of natural numbers and computability of various functions
• scientific article; zbMATH DE number 2084341
• On the problem of the choice of the radix
• scientific article; zbMATH DE number 3931097

Cites work

• A new recursion-theoretic characterization of the polytime functions
• Acceptable notation
• Cobham recursive set functions
• Computational Complexity
• Fast multiplication of large numbers
• Faster integer multiplication
• Honest computability and complexity
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 719756 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• Polynomial-time versus recursive models
• Power circuits, exponential algebra, and time complexity
• Safe recursive set functions

Cited in

(1)

• Degrees of relations on canonically ordered natural numbers and integers

This page was built for publication: On efficiency of notations for natural numbers

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