Complexity of Algorithms: Lecture Notes, Spring 1999
Читать фрагмент
Моментальное скачивание
после оплаты (24/7)
Широкий выбор форматов
(для всех устройств)
Полная версия книги
(в т.ч. для Apple и Android)
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.
LF/811903/R
Характеристики
- ФИО Автора
- László Lovász
Peter Gács - Язык
- Английский
- Дата выхода
- 1999
15 книг этого же автора
Товары из этой категории:
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 mo...