
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 problemsPrerequisites: CSE 373.
Credits: 3
Portions of the CSE 417 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 417 Web: © 1993-2013, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE417 (authentication required).
- Current Quarter
- Prerequisites
- Previous Quarters
- Winter, 2012 (Birnbaum)
- Winter, 2011 (Tanimoto)
- Winter, 2010 (Ecelis)
- Winter, 2009 (Ruzzo)
- Winter, 2008 (Nobody)
- Winter, 2007 (Ruzzo)
- Winter, 2006 (Ruzzo)
- Winter, 2005 (Ruzzo)
- Winter, 2004 (Tompa)
- Autumn, 2002 (Beame)
- Winter, 2002 (Ruzzo)
- Winter, 2001 (Beame)
- Winter, 2000 (Beame)
- Winter, 1999 (Karp)
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX
