English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A lower bound for the nondeterministic space complexity of context-free recognition

Alt, H., Geffert, V., & Mehlhorn, K. (1992). A lower bound for the nondeterministic space complexity of context-free recognition. Information Processing Letters, 42, 25-27.

Item is

Files

show Files
hide Files
:
Mehlhorn95.pdf (Publisher version), 87KB
 
File Permalink:
-
Name:
Mehlhorn95.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Alt, Helmut1, Author
Geffert, Viliam1, Author
Mehlhorn, Kurt2, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-12-191992
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344533
Other: Local-ID: C1256428004B93B8-FE3660A88DFABA50C125707E002F1570-Mehlhorn92j
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 42 Sequence Number: - Start / End Page: 25 - 27 Identifier: ISSN: 0020-0190