.
 
.

Methods in Algorithmic Analysis

.
Redna cena: 102,00 €
Predvideni rok dobave: 14-21 dni
.
.
Količina:  
.
Strošek dostave je enoten za celo Slovenijo in znaša 2,95 €, ne glede na količino in vrsto kupljenih izdelkov.

Številni izdelki imajo oznako "brezplačna dostava", kar pomeni, da v prmeru nakupa takšnega izdelka poštnine ne boste plačali. 

Več o dostavi
Emka.si omogoča naslednje načine plačila:
  • z gotovino ob prevzemu (velja le za fizične osebe),
  • s plačilno oziroma kreditno kartico (Mastercard, Visa, ActivaMaestro, Activa, Diners, American Express),
  • s storitvijo Moneta (Mobitel in Simobil)
  • Plačilo po predračunu (pravne osebe)
  • Račun z odlogom plačila (za javna podjetja)
Več o plačilih

Pri vsakem izdelku je naveden predviden rok dostave. Glede na to katere izdelke izberete, se vam pri oddaji naročila prikaže tudi končni predviden datum dobave vašega pakete.

Večino izdelkov dostavljamo iz lastne zaloge, zato so naši dobavni roki zelo kratki.

Ko vam bomo poslali paket boste o tem obveščeni tudi po emailu. V emailu bo navedena številka vašega paketa ter povezava do Pošte Slovenije, kjer boste lahko preverili natančen status dostave.

Več o dostavi

To je spletna cena
Shrani v seznam želja
.

.

Opis

Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science
A flexible, interactive teaching format enhanced by a large selection of examples and exercises


Developed from the author’s own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.


 


After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes’ theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.


 


Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students’ understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.

.
.
.

O avtorju - Vladimir A. Dobrushkin

Obvestite me o novi knjigi tega avtorja

Želite, da vas po elektronski pošti obvestimo, ko izide nova knjiga ali ponatis katere od knjig tega avtorja?

DA - obveščajte me o novostih avtorja
.
.
.
.

Podrobnosti o izdelku

Mnenja kupcev

  0  ocen:
5 zvezdice
0%
(0)
4 zvezdice
0%
(0)
3 zvezdice
0%
(0)
2 zvezdice
0%
(0)
1 zvezdica
0%
(0)
Povprečna ocena kupcev:
Ocena kupcev: 0
(0 ocen uporabnikov )
.
Ocenite izdelek s klikom na zvezdice:
 
.
.
.
.
.

Oznake kupcev o tem izdelku

Kliknite na posamezno oznako za prikaz vseh izdelkov označenih s to oznako:

Dodaj oznako:

Dodaj
.