Characterizing time computational complexity classes with polynomial differential equations
In this paper we show that several classes of languages from computational complexity theory, such as EXPTIME, can be characterized in a continuous manner by using only polynomial differential equations. This characterization applies not only to languages, but also to classes of functions, such as t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2022
|
| Online Access: | http://hdl.handle.net/10400.1/18413 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/18413 |