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 Properties (CBMS-NSF Regional Conference Series in Applied Mathematics)Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics)

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

Juris Hartmanis

Details

OL Work ID
OL6802442W

Subjects

Machine theoryFormal languages

Find this book

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