Feasible Computations and Provable Complexity Properties
Download or Read eBook Feasible Computations and Provable Complexity Properties PDF written by Juris Hartmanis and published by SIAM. This book was released on 1978-01-01 with total page 65 pages. Available in PDF, EPUB and Kindle.
Author | : Juris Hartmanis |
Publisher | : SIAM |
Total Pages | : 65 |
Release | : 1978-01-01 |
ISBN-10 | : 9780898710274 |
ISBN-13 | : 0898710278 |
Rating | : 4/5 (74 Downloads) |
Book Synopsis Feasible Computations and Provable Complexity Properties by : Juris Hartmanis
Book excerpt: An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.