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.

Proof complexity and feasible arithmeticsProof complexity and feasible arithmetics

Proof complexity and feasible arithmetics

Samuel R. Buss, Paul W. Beame

Details

OL Work ID
OL23646470W

Subjects

Computational complexityCongressesProof theoryConstructive mathematics

Find this book

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