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
N. N. Kuzyurin, S. A. Fomin
Publisher
Not specified
Year
2018
Language
Russian
166
Rate this book

To read the book, log in / register

Preview fragment

Similar books

Algorithms and Computation Models

Algorithms and Computation Models

Dmitry Golubenko, Alexey Kroshnin, Eduard Gorbunov

Algorithm Theory

Algorithm Theory

V.I. Igoshin

Development and Analysis of Computer Algorithms

Development and Analysis of Computer Algorithms

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman

40 Algorithms Every Python Programmer Should Know

40 Algorithms Every Python Programmer Should Know

Imran Ahmad

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

Martin Erwig

Algorithms and data processing structures

Algorithms and data processing structures

M. G. Kurnosov, D. M. Berlizov

Grokking Algorithms. Second Edition

Grokking Algorithms. Second Edition

Aditya Bhargava

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.

George Heineman, Gary Pollice, Stanley Selkow

What is Mathematics? An Elementary Sketch of Ideas and Methods

What is Mathematics? An Elementary Sketch of Ideas and Methods

R. Courant, H. Robbins