The "almost all" theory of subrecursive degrees is decidable

Local TagsRelease HistoryDetailsSummary

The "almost all" theory of subrecursive degrees is decidable

Mehlhorn, K. (1973). The "almost all" theory of subrecursive degrees is decidable. Ithaca, NY, USA: IEEE.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFF0-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFF1-2

Genre: Other

show

show

hide

Creators:
Mehlhorn, Kurt¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Modified: 2006-11-03Date issued: 1973

Publication Status: Issued

Pages: -

Publishing info: Ithaca, NY, USA : IEEE

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344755
Other: Local-ID: C1256428004B93B8-64BB5EC72EAD40C0C125721B0033D2F8-mehlhorn73

Degree: -

show

hide

Title: Untitled Event

Place of Event: Iowa City, Iowa, USA

Start-/End Date: 1973-10-15

show

show

show