Lex

Browse

GenresShelvesPremiumBlog

Company

AboutJobsPartnersSell on LexAffiliates

Resources

DocsInvite FriendsFAQ

Legal

Terms of ServicePrivacy Policygeneral@lex-books.com(215) 703-8277

© 2026 LexBooks, Inc. All rights reserved.

Feasible computations and provable complexity propertiesFeasible computations and provable complexity properties

Feasible computations and provable complexity properties

Juris Hartmanis

Details

OL Work ID
OL6802445W

Subjects

Computational complexityFormal languagesMachine theory

Find this book

Open Library
Book data from Open Library. Cover images courtesy of Open Library.