Die Inhalte dieser Webseite enthalten Affiliate-Links, für die wir möglicherweise eine Vergütung erhalten.
  • Bild 1

Computer und Intraktierbarkeit: Ein Leitfaden zur Theorie der NP-Vollständigkeit (Serie

20,33 €

A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. Powered by ExportYourStore.com

Jetzt bei Ebay: