Product-Free Lambek Calculus Is NP-Complete (Q3605542): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Non‐associative Lambek Categorial Grammar in Polynomial Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263011 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Mathematics of Sentence Structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lambek calculus is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lambek Grammars with One Division Are Decidable in Polynomial Time / rank | |||
Normal rank |
Latest revision as of 02:42, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Product-Free Lambek Calculus Is NP-Complete |
scientific article |
Statements
Product-Free Lambek Calculus Is NP-Complete (English)
0 references
24 February 2009
0 references