Characterizing time computational complexity classes with polynomial differential equations (Q5880938)
From MaRDI portal
!
WARNING
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 7661117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing time computational complexity classes with polynomial differential equations |
scientific article; zbMATH DE number 7661117 |
Statements
Characterizing time computational complexity classes with polynomial differential equations (English)
0 references
9 March 2023
0 references
analog computation
0 references
computation with polynomial ordinary differential equations
0 references
EXPTIME
0 references
Grzegorczyk hierarchy
0 references
0 references
0 references
0 references
0 references
0 references
0.8086628913879395
0 references
0.7916828393936157
0 references
0.7732658982276917
0 references
0.7389914989471436
0 references
