Computational complexity of the semantics of some natural language constructions (Q598312)
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: Computational complexity of the semantics of some natural language constructions |
scientific article; zbMATH DE number 2083199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the semantics of some natural language constructions |
scientific article; zbMATH DE number 2083199 |
Statements
Computational complexity of the semantics of some natural language constructions (English)
0 references
6 August 2004
0 references
NP-completeness
0 references
PTIME
0 references
Henkin quantifiers
0 references
Edmond's Thesis
0 references
Church's Thesis
0 references
0.7974429130554199
0 references
0.7929239869117737
0 references
0.7685018181800842
0 references
0.7661967873573303
0 references
0.7615320682525635
0 references
