Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:15, 4 February 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
