Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (Q3540133)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard |
scientific article; zbMATH DE number 5369331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard |
scientific article; zbMATH DE number 5369331 |
Statements
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (English)
0 references
20 November 2008
0 references
0 references
0.7918603420257568
0 references
0.7493888139724731
0 references
0.7397139668464661
0 references