Product-free Lambek calculus is NP-complete (Q408532): Difference between revisions

@@ Property / DOI @@
-.1016/j.apal.2011.09.017
@@ Property / DOI: 10.1016/j.apal.2011.09.017 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apal.2011.09.017
+Normal rank
@@ Property / OpenAlex ID @@
+W4206777114
@@ Property / OpenAlex ID: W4206777114 / rank @@
+Normal rank
@@ Property / cites work @@
+Non‐associative Lambek Categorial Grammar in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q4263011
@@ Property / cites work: Q4263011 / rank @@
+Normal rank
@@ Property / cites work @@
+The Mathematics of Sentence Structure
@@ Property / cites work: The Mathematics of Sentence Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Lambek calculus is NP-complete
@@ Property / cites work: Lambek calculus is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Lambek Grammars with One Division Are Decidable in Polynomial Time
+Normal rank
@@ Property / DOI @@
+.1016/J.APAL.2011.09.017
@@ Property / DOI: 10.1016/J.APAL.2011.09.017 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:408532