Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages computable in polynomial time in terms of differential equations with polynomial...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.1/10075 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/10075 |