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.

On the complexity of functions defined by recurrence relations

On the complexity of functions defined by recurrence relations

G. Ausiello

Details

OL Work ID
OL6422102W

Subjects

Computational complexityData processingFunctionsRecursive functions

Find this book

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