Portál ZČU > Courseware > KMA > AVS

Anonymous user Login Česky

HelpDesk - user support contact

Drobečková navigace

Portál ZČU > Courseware > Předměty po fakultách > Fakulta aplikovaných věd > KMA > AVS > Studijní materiály

AVS

Navigace

KMA/AVS

Algorithms and Complexity

Guarantors: doc. Ing. Roman Čada, Ph.D.

Course literature KMA/AVS -IS/STAG

Basic
Bovet, Daniel Pierre; Crescenzi, Pierluigi, Introduction to the theory of complexity 1994
Sipser, Michael, Introduction to the theory of computation , Boston : Thomson Course Technology 2006
Extending
Sedgewick, Robert; Flajolet, Philippe, An introduction to the analysis of algorithms , Boston : Addison-Wesley 1996
Williamson, D.P.; Shmoys, D.B., The Design of Approximation Algorithms , Cambridge University Press 2011
Recommended
Hromkovič, Juraj, Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics , Berlin : Springer 2003
Vazirani, Vijay V., Approximation algorithms , Berlin : Springer 2001
Rothe, Jörg, Complexity theory and cryptology : an introduction to cryptocomplexity 2005

Sanjeev Arora, Boaz Barak: Computational Complexity: A Modern Approach, https://theory.cs.princeton.edu/complexity/book.pdf

D. P. Bovet, P. Crescenzi, Introduction to the theory of complexity, https://www.tcs.ifi.lmu.de/lehre/ws-2015-16/kompl/bovetcrescenzi

D. P. Williamson, D. B. Shmoys: The Design of Approximation Algorithms, https://www.designofapproxalgs.com/book.pdf

A. Pettorossi: Automata Theory and Formal Languages, https://core.ac.uk/download/pdf/53862088.pdf

Avi Wigderson: Mathematics + Computation, https://www.math.ias.edu/avi/book

Last updated: 10.03.2021

Studijní materiály

Does not contain documents.

> Courseware > KMA > AVS > Studijní materiály - Portál ZČU