Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents |
scientific article |
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
