Term graphs and the NP-completeness of the product-free Lambek calculus (Q2999263)
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: Term graphs and the NP-completeness of the product-free Lambek calculus |
scientific article; zbMATH DE number 5887464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Term graphs and the NP-completeness of the product-free Lambek calculus |
scientific article; zbMATH DE number 5887464 |
Statements
Term Graphs and the NP-Completeness of the Product-Free Lambek Calculus (English)
0 references
11 May 2011
0 references
0.8790268898010254
0 references
0.8645725250244141
0 references
0.854773759841919
0 references
0.8405275344848633
0 references
0.8377223014831543
0 references
