The Product-Free Lambek-Grishin Calculus Is NP-Complete

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	Logical Aspects of Computational Linguistics
Editors	S. Pogodalla, J.-P. Prost
Publisher	Springer
Pages	49-63
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-22221-4_4
Publication status	Published - 2011

Access to Document

@inproceedings{ef502922be5a4884a57ca887fd9a0d57,

title = "The Product-Free Lambek-Grishin Calculus Is NP-Complete",

author = "J. Bransen",

year = "2011",

doi = "10.1007/978-3-642-22221-4\_4",

language = "Undefined/Unknown",

pages = "49--63",

editor = "S. Pogodalla and J.-P. Prost",

booktitle = "Logical Aspects of Computational Linguistics",

publisher = "Springer",

}