Computer und Intraktierbarkeit: Ein Leitfaden zur Theorie der NP-Vollständigkeit WIE NEU
34,24 €
"Computers and Intractability: A Guide to the Theory of NP-Completeness" is a textbook authored by D.S. Johnson and M. R. Garey, originally published in 1979 by Freeman & Company, W&H. This guide delves into the theory of NP-completeness in the realm of Mathematics and Computers, with a focus on programming and discrete mathematics. With 340 pages, this trade paperback covers the subject areas of general and specific algorithms, making it a valuable resource for students and professionals alike in understanding the complexities of computer science.
Jetzt bei Ebay:
