On efficiency of notations for natural numbers

DOI10.1016/j.tcs.2022.02.015OpenAlexW4213302006MaRDI QIDQ2143116

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

complexitypolynomial timenatural numbersnotations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Cobham recursive set functions
• Acceptable notation
• Polynomial-time versus recursive models
• A new recursion-theoretic characterization of the polytime functions
• Fast multiplication of large numbers
• Honest Computability and Complexity
• SAFE RECURSIVE SET FUNCTIONS
• POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY
• Computational Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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