Loading...
Please wait, while we are loading the content...
Similar Documents
Computational Complexity of Initial Value Problems (2008)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kawamura, A. |
| Abstract | We show, in answer to K. Ko’s question raised in 1983, that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a polynomial-space complete solution. |
| File Format | |
| Publisher Date | 2008-01-01 |
| Access Restriction | Open |
| Subject Keyword | Initial Value Problem Computational Complexity Polynomial-space Complete Solution Polynomial-time Computable Continuous Function Ko Question Lipschitz Continuity Let Lipschitz Continuous Function |
| Content Type | Text |