Yury Savateev. Product-Free Lambek Calculus Is NP-Complete. In Sergei N. Artëmov, Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Volume 5407 of Lecture Notes in Computer Science, pages 380-394, Springer, 2009. [doi]
@inproceedings{Savateev09,
title = {Product-Free Lambek Calculus Is NP-Complete},
author = {Yury Savateev},
year = {2009},
doi = {10.1007/978-3-540-92687-0_26},
url = {http://dx.doi.org/10.1007/978-3-540-92687-0_26},
tags = {completeness},
researchr = {https://researchr.org/publication/Savateev09},
cites = {0},
citedby = {0},
pages = {380-394},
booktitle = {Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings},
editor = {Sergei N. Artëmov and Anil Nerode},
volume = {5407},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-92686-3},
}