Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (Q3540133): Difference between revisions

@@ Property / cites work @@
+Lexicalized non-local MCTAG with dominance links is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4840204
@@ Property / cites work: Q4840204 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical aspects of computational linguistics. 4th international conference, LACL 2001, Le Croisic, France, June 27--29, 2001. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4547851
@@ Property / cites work: Q4547851 / rank @@
+Normal rank
@@ Property / cites work @@
+Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power
+Normal rank
@@ Property / cites work @@
+Q2762877
@@ Property / cites work: Q2762877 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547853
@@ Property / cites work: Q4547853 / rank @@
+Normal rank
@@ Property / cites work @@
+Observations on Strict Derivational Minimalism
@@ Property / cites work: Observations on Strict Derivational Minimalism / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Aspects of Computational Linguistics
@@ Property / cites work: Logical Aspects of Computational Linguistics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3615444
@@ Property / cites work: Q3615444 / rank @@
+Normal rank