Every recursive linear ordering has a copy in dtime-space (n, log(n))

Journal of Symbolic Logic 55 (1):260-276 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
240 (#112,867)

6 months
9 (#328,796)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.

View all 9 citations / Add more citations

References found in this work

Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.

Add more references