Slovenčina
Aproximačné a pravdepodobnostné algoritmy
E-book
Ondrej Krídlo - Gabriel Semanišin
For computer scientists, the constant challenge is to seek efficient algorithms and various technical and implementation possibilities to improve the computational complexity of currently known algorithms. Partial solutions are offered by approaches such as grid-based methods and parallelization of computation. Quantum computers represent a significant but still unfulfilled promise. From a theoretical perspective, probabilistic and approximation approaches provide very effective solutions, and these are the methods we aim to explore in detail.
These electronic university textbooks serve as supplementary materials for the course Approximation and Probabilistic Algorithms. They were developed from the authors' materials and contributions by Prof. RNDr. Viliam Geffert, DrSc., whom the authors thank for providing the manuscript. Acknowledgments also extend to RNDr. Ján Katrenič, PhD., who prepared the first set of exercises for the course, and Žaneta Semanišinová, who reviewed large portions of the text and contributed suggestions for its improvement.
