English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
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

Bringmann, K., & Wellnitz, P. (2017). Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. In J. Kärkkäinen, J. Radoszweski, & W. Rytter (Eds.), 28th Annual Symposium on Combinatorial Pattern Matching (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.CPM.2017.12.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-FB92-0
Abstract
There is no abstract available