English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  On the Size of Sets of Computable Functions

Mehlhorn, K. (1973). On the Size of Sets of Computable Functions. In 14th Annual Symposium on Switching & Automata Theory (SSAT-73) (pp. 190-196). Northridge, CA, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFEB-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFEC-0
Genre: Conference Paper

Files

show Files
hide Files
:
Mehlhorn_1973_a_m.pdf (Any fulltext), 6MB
 
File Permalink:
-
Name:
Mehlhorn_1973_a_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           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-01-091973
 Publication Status: Issued
 Pages: -
 Publishing info: Northridge, CA, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344679
Other: Local-ID: C1256428004B93B8-CA39A2975EE5617BC12571C40041429E-mehlhorn73a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Iowa City, Iowa, USA
Start-/End Date: 1973-10-15

Legal Case

show

Project information

show

Source 1

show
hide
Title: 14th Annual Symposium on Switching & Automata Theory (SSAT-73)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Northridge, CA, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 190 - 196 Identifier: ISBN: --