Feasible Computations and Provable Complexity Properties - Juris Hartmanis
-20% with code BOOKS
Shipping in 28-34 days
30-day return policy
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
Description
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
More Information
| Author | Juris Hartmanis |
|---|---|
| Publisher | Society for Industrial and Applied Mathematics (SIAM) |
| Release year | 1987 |
| Cover type | Softcover |
| EAN | 9780898710274 |