Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/2274966 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2165339507 / rank | |||
Normal rank |
Revision as of 15:34, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) |
scientific article |
Statements
Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (English)
0 references
1990
0 references
recursive ordinal
0 references
recursive total orderings over N
0 references
minimal complexity
0 references
time
0 references
space
0 references