Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227)
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: Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents |
scientific article; zbMATH DE number 6399319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents |
scientific article; zbMATH DE number 6399319 |
Statements
Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (English)
0 references
9 February 2015
0 references
reciprocal sentences
0 references
computational complexity
0 references
experimental semantics
0 references
0 references
0.84138936
0 references
0.84138936
0 references
0.83508945
0 references
0.83393943
0 references
0 references
