157,95 €
157,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
79 °P sammeln
157,95 €
157,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
79 °P sammeln
Als Download kaufen
157,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
79 °P sammeln
Jetzt verschenken
157,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
79 °P sammeln
  • Format: PDF

The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues, the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described…mehr

  • Geräte: PC
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 6.48MB
  • FamilySharing(5)
Produktbeschreibung
The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues, the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described such as graph and network algorithms, algebraic algorithms, parallel algorithms and randomized algorithms.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.