On efficiency of notations for natural numbers (Q2143116): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Fast multiplication of large numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549597 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-time versus recursive models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Honest Computability and Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4321931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5586401 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3800030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5286672 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SAFE RECURSIVE SET FUNCTIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cobham recursive set functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acceptable notation / rank | |||
Normal rank |
Latest revision as of 04:05, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On efficiency of notations for natural numbers |
scientific article |
Statements
On efficiency of notations for natural numbers (English)
0 references
31 May 2022
0 references
notations
0 references
natural numbers
0 references
complexity
0 references
polynomial time
0 references