Handbook of Theoretical Computer Science: Algorithms and complexity

Handbook of Theoretical Computer Science: Algorithms and complexity

by Jan Leeuwen

1003 pages· 1990· ISBN 9780444880710
About
The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.

Discuss Handbook of Theoretical Computer Science: Algorithms and complexity with other readers

Join or start a book club for Handbook of Theoretical Computer Science: Algorithms and complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Handbook of Theoretical Computer Science: Algorithms and complexity?

Sign up free on Readfeed, then browse public clubs or start your own club with Handbook of Theoretical Computer Science: Algorithms and complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Handbook of Theoretical Computer Science: Algorithms and complexity with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Handbook of Theoretical Computer Science: Algorithms and complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.