Feasible Computations and Provable Complexity Properties Quotes

Rate this book

Clear rating

1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars

Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)

Feasible Computations and Provable Complexity Properties by Juris Hartmanis
3 ratings, 4.00 average rating, 0 reviews

Feasible Computations and Provable Complexity Properties Quotes Showing 0-0 of 0

All Quotes
Quotes By Juris Hartmanis