English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  The 'almost all' theory of subrecursive degrees is decidable

Mehlhorn, K. (1974). The 'almost all' theory of subrecursive degrees is decidable. In Automata, languages and programming: 2nd colloquium (ICALP-74) (pp. 317-325). Berlin, Germany: Springer.

Item is

Files

show Files
hide Files
:
Mehlhorn_1974_d_m.pdf (Any fulltext), 5MB
 
File Permalink:
-
Name:
Mehlhorn_1974_d_m.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Loeckx, Jacques2, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-01-091974
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344556
Other: Local-ID: C1256428004B93B8-C7A57ECB57F1B837C12571400043FB06-Mehlhorn74
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Saarbrücken, Germany
Start-/End Date: 1974-07-29

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, languages and programming : 2nd colloquium (ICALP-74)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 317 - 325 Identifier: ISBN: 3-540-06841-4

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -