On the complexity of formulas in semantic programming (Q1615728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6969396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of formulas in semantic programming |
scientific article; zbMATH DE number 6969396 |
Statements
On the complexity of formulas in semantic programming (English)
0 references
31 October 2018
0 references
semantic programming
0 references
list structures
0 references
polynomial time/space complexity
0 references
\(\Delta_0\)-formulas
0 references
0.89861774
0 references
0 references
0.8947613
0 references
0.89018005
0 references
0.8823743
0 references
