English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Clique-based Lower Bounds for Parsing Tree-adjoining Grammars

Wellnitz, P. (2017). Clique-based Lower Bounds for Parsing Tree-adjoining Grammars. Bachelor Thesis, Universität des Saarlandes, Saarbrücken.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002E-2745-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002E-2746-D
Genre: Thesis

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Referee           
Wellnitz, Philip2, Author
Mehlhorn, Kurt1, Advisor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2017
 Publication Status: Issued
 Pages: 13 p.
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmannphd2017
 Degree: Bachelor

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title:
  Abbreviation :
Source Genre: -
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -