Books like Computers and intractability by Michael R. Garey


First publish date: 1979
Authors: Michael R. Garey
★ ★ ★ ★ ★ 0.0 (0 community ratings)

Computers and intractability by Michael R. Garey

How are these books recommended?

The books recommended for Computers and intractability by Michael R. Garey are shaped by reader interaction. Votes on how closely books relate, user ratings, and community comments all help refine these recommendations and highlight books readers genuinely find similar in theme, ideas, and overall reading experience.


Have you read any of these books?
Your votes, ratings, and comments help improve recommendations and make it easier for other readers to discover books they’ll enjoy.

Books similar to Computers and intractability (8 similar books)

Introduction to Algorithms by 52207|Thomas H. Cormen book cover

πŸ“˜ Introduction to Algorithms


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 4.1 (19 ratings)
Similar? ✓ Yes 0 ✗ No 0
Introduction to the Theory of Computation by 8761929|Michael Sipser book cover

πŸ“˜ Introduction to the Theory of Computation


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 4.4 (5 ratings)
Similar? ✓ Yes 0 ✗ No 0
Theory of computation by 8761929|Michael Sipser book cover

πŸ“˜ Theory of computation


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0
Modern computer algebra by 11839848|Joachim von zur Gathen book cover

πŸ“˜ Modern computer algebra

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the "bible of computer algebra", gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two- semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, crytopgraphy, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text.

β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0
Algorithm design by 7756883|Eva Tardos book cover

πŸ“˜ Algorithm design
 by Eva Tardos

Algorithm Design introduces classic and modern algorithmic techniques through real‑world problems, guiding students to formulate, analyze, and solve problems by applying appropriate design principles in a clear, direct style.

β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0
Inspire Computing International, Student Book, Year 7 by 12427579|Paul Clowrey book cover

πŸ“˜ Inspire Computing International, Student Book, Year 7


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0
Inspire Computing International, Workbook, Year 9 by 12427579|Paul Clowrey book cover

πŸ“˜ Inspire Computing International, Workbook, Year 9


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0
Inspire Computing International, Student Book, Year 9 by 12427579|Paul Clowrey book cover

πŸ“˜ Inspire Computing International, Student Book, Year 9


β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜…β˜… 0.0 (0 ratings)
Similar? ✓ Yes 0 ✗ No 0

Some Other Similar Books

Computational Complexity by Christos Papadimitriou
The Design and Analysis of Algorithms by Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
Computability and Complexity by Herbert Enderton
The Nature of Computation by Christos Papadimitriou
Computability, Complexity, and Algorithms by Michael Sipser
Complexity Theory: A Modern Approach by Lance Fortnow, Steve Homer

Have a similar book in mind? Let others know!

Please login to submit books!