Efficient Algorithms and Computational Complexity
A

Efficient Algorithms and Computational Complexity

Algorithms
algorithms computational complexity NP-completeness approximation algorithms probabilistic algorithms graph theory polynomial time
Author
Н. Н. Кузюрин, С. А. Фомин
Publisher
Не указано
Year
2018
Language
Russian
41
Rate this book

To read the book, log in / register

Preview fragment

Similar books

Algorithms and Computation Models

Algorithms and Computation Models

Дмитрий Голубенко, Алексей Крошнин, Эдуард Горбунов

Algorithm Theory

Algorithm Theory

В.И. Игошин

Development and Analysis of Computer Algorithms

Development and Analysis of Computer Algorithms

Альфред В. Ахо, Джон Э. Хопкрофт, Джеффри Д. Ульман

40 Algorithms Every Python Programmer Should Know

40 Algorithms Every Python Programmer Should Know

Имран Ахмад

Algorithms from Scratch

Algorithms from Scratch

Cuantum Technologies

Entertaining Algorithms: What the Stories of Famous Heroes Teach Us

Entertaining Algorithms: What the Stories of Famous Heroes Teach Us

Мартин Эрвиг

Algorithms and data processing structures

Algorithms and data processing structures

М. Г. Курносов, Д. М. Берлизов

Grokking Algorithms. Second Edition

Grokking Algorithms. Second Edition

Адитья Бхаргава

Algorithms. A Reference with Examples in C, C++, Java, and Python. Second Edition.

Algorithms. A Reference with Examples in C, C++, Java, and Python. Second Edition.

Джордж Хайнеман, Гэри Поллис, Стэнли Селков

What is Mathematics? An Elementary Sketch of Ideas and Methods

What is Mathematics? An Elementary Sketch of Ideas and Methods

Р. Курант, Г. Роббинс