English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

An improved lower bound on the formula complexity of context-free recognition

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K.(1976). An improved lower bound on the formula complexity of context-free recognition (Local-ID: C1256428004B93B8-CD622EEA82E2D4C9C125721B00327D32-mehlhorn76v). Saarbrücken: Fachbereich Informatik, Universität des Saarlandes.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AFCC-7
Abstract
There is no abstract available