CSE417: Algorithms and Computational Complexity

Catalog Description Design and analysis of algorithms and data structures. Efficient algorithms for manipulating graphs and strings. Fast Fourier Transform. Models of computation, including Turing machines. Time and space complexity. NP-complete problems and undecidable problems

Prerequisites: CSE 373.
Credits: 3.0

Portions of the CSE417 web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly creditied. The CSE417 Web: © 1993-2016, Department of Computer Science and Engineering, Univerity of Washington. Administrative information on CSE417 (authentication required).