共 9 条
- [3] Product-Free Lambek Calculus Is NP-Complete LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, 2009, 5407 : 380 - 394
- [6] The Product-Free Lambek-Grishin Calculus Is NP-Complete LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, LACL 2011, 2011, 6736 : 49 - 63
- [7] Term Graphs and the NP-Completeness of the Product-Free Lambek Calculus FORMAL GRAMMAR, 2011, 5591 : 150 - 166