Minimum-complexity pairing functions (Q1201876): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4052072 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3893911 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3954784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636862 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3915990 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4153600 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762301 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Real-Time Definable Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On storing concatenable arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storage schemes for boundedly extendible arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast multiplication of large numbers / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(92)90027-g / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2011541295 / rank | |||
Normal rank |
Latest revision as of 09:50, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum-complexity pairing functions |
scientific article |
Statements
Minimum-complexity pairing functions (English)
0 references
17 January 1993
0 references
linear-time computability
0 references
on-line computation
0 references
pairing function
0 references
constant space
0 references
log space
0 references