Feasible Computations and Provable Complexity Properties - Juris Hartmanis
-40% koodiga BOOKS
Saadetis 28-34 tööpäeva jooksul
30-päevane tagastamisõigus
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
Kirjeldus
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
Lisateave
| Autor | Juris Hartmanis |
|---|---|
| Kirjastaja | Society for Industrial and Applied Mathematics (SIAM) |
| Väljalaskeaasta | 1987 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9780898710274 |