Complexity of Algorithms: Lecture Notes, Spring 1999

Main
Computers - Computer Science
Complexity of Algorithms: Lecture...

Complexity of Algorithms: Lecture Notes, Spring 1999

Peter Gács, László Lovász

0 / 0

0 comments

Jak bardzo podobała Ci się ta książka?

Jaka jest jakość pobranego pliku?

Pobierz książkę, aby ocenić jej jakość

Jaka jest jakość pobranych plików?

The need to be able to measure the complexity of a problem, algorithm or structure, and to obtain bounds and quantitive relations for complexity arises in more and more sciences: besides computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering are also confronted more and more frequently with this problem. In the approach taken by computer science, complexity is measured by the quantity of computational resources (time, storage, program, communication) used up by a particualr task. These notes deal with the foundations of this theory.

Kategorie:

Computers - Computer Science

Rok:

1999

Wydawnictwo:

Boston University

Język:

english

Strony:

180

Plik:

EPUB, 205 KB