de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

An Improved Lower Bound on the Formula Complexity of Context-Free Recognition

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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. Elektronische Informationsverarbeitung und Kybernetik, 12, 523-524.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AFB4-C
Abstract
There is no abstract available