Get Approximative Algorithmen und Nichtapproximierbarkeit (De PDF

By Klaus / Margraf, Marian Jansen

ISBN-10: 3110203162

ISBN-13: 9783110203165

Gegenstand dieses Lehrbuchs ist die Behandlung schwer lösbarer diskreter Optimierungsprobleme. Im ersten Teil werden schnelle Algorithmen vorgestellt, die solche Probleme näherungsweise lösen können. Der zweite Teil behandelt Komplexitätstheorie und Nichtapproximierbarkeit von Optimierungsproblemen. Das Lehrbuch enthält zudem zahlreiche Anwendungsbeispiele, Übungsaufgaben, Illustrationen und Abschnitte über Grundlagen wie etwa die Turingmaschine.

Show description

Read or Download Approximative Algorithmen und Nichtapproximierbarkeit (De Gruyter Lehrbuch) (German Edition) PDF

Similar combinatorics books

Download e-book for kindle: Diophantine Analysis (Discrete Mathematics and Its by Jorn Steuding

Whereas its roots succeed in again to the 3rd century, diophantine research is still a really energetic and strong region of quantity concept. Many diophantine difficulties have uncomplicated formulations, they are often super tricky to assault, and plenty of open difficulties and conjectures stay. Diophantine research examines the idea of diophantine approximations and the speculation of diophantine equations, with emphasis on interactions among those topics.

A Course in Topological Combinatorics (Universitext) by Mark de Longueville PDF

A direction in Topological Combinatorics is the 1st undergraduate textbook at the box of topological combinatorics, an issue that has develop into an energetic and cutting edge examine quarter in arithmetic over the past thirty years with turning out to be purposes in math, desktop technology, and different utilized parts.

Get Handbook of Elliptic and Hyperelliptic Curve Cryptography PDF

The discrete logarithm challenge in line with elliptic and hyperelliptic curves has received loads of attractiveness as a cryptographic primitive. the most cause is that no subexponential set of rules for computing discrete logarithms on small genus curves is presently on hand, other than in very distinct circumstances. hence curve-based cryptosystems require a lot smaller key sizes than RSA to achieve an analogous protection point.

Download e-book for kindle: Simulation for Applied Graph Theory Using Visual C++ by Shaharuddin Salleh,Zuraida Abal Abas

The device for visualisation is Microsoft visible C++. This well known software program has the normal C++ mixed with the Microsoft beginning sessions (MFC) libraries for home windows visualization. This publication explains tips to create a graph interactively, clear up difficulties in graph idea with minimal variety of C++ codes, and supply pleasant interfaces that makes studying the subjects an enticing one.

Extra info for Approximative Algorithmen und Nichtapproximierbarkeit (De Gruyter Lehrbuch) (German Edition)

Sample text

Download PDF sample

Approximative Algorithmen und Nichtapproximierbarkeit (De Gruyter Lehrbuch) (German Edition) by Klaus / Margraf, Marian Jansen

by Daniel

Rated 4.90 of 5 – based on 29 votes