Normal view MARC view ISBD view

Feasible computations and provable complexity properties

Juris Hartmanis

Feasible computations and provable complexity properties - Socy For Indl.& Appld. Mathematics SIAM 1989 - 62

SAR/20/2009/11-05-09

Subjects--Topical Terms:
Machine theory
Formal languages
Computational complexity

Place hold
Print
Suggest for purchase
Send to device
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)