CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
Authors
Karl Bringmann
Philip Wellnitz
Publication date
1 January 2017
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Doi
Cite
View
on
arXiv
Abstract
up to lower order factors
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:escidoc.org:escidoc:258500...
Last time updated on 14/05/2018
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.mpg.de:item_2585002
Last time updated on 15/06/2019
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.mpg.de:item_2483652
Last time updated on 15/06/2019
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:7332
Last time updated on 13/08/2017
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:escidoc.org:escidoc:248365...
Last time updated on 12/10/2017