Mar 11, 2025  
2015-2016 Academic Catalog 
    
Catalog Navigation
  Catalog Home
  Archived Catalogs
  Schools and Departments
  Undergraduate Degree Programs
  Graduate Degree Programs
  Courses
  Course Prefix Identification and Coding Rationale
  The University
  University Calendars: 2015-2016
  Libraries and Learning Technologies
  Academic Support Services
  AUC Press
  Undergraduate Admissions
  First-Year Experience Program
  Undergraduate Studies
  Academic Advising Center
  The Core Curriculum
  Undergraduate Academic Requirements & Regulations
  Undergraduate Student Finances
  Graduate Admissions
  Graduate Academic Requirements & Regulations
  Graduate Student Finances
  Research
  Community Based Learning
  Continuing Education and Training Programs
  Leadership
  Facts and Figures
  Catalog PDF Extract
  My Portfolio
HELP
2015-2016 Academic Catalog [Published Catalog]

Add to Portfolio (opens a new window)

CSCE 525/5221  -  Algorithms and Complexity Theory (3 cr.)


Description
Measures of the complexity of algorithms. Amortized complexity. Greedy algorithms. Dynamic programming. NP-Completeness and lower-bound theory. Cook’s Theorem. Techniques for proving problems NP-complete. Complexity of parallel algorithms. Well-parallelizable and hardly-parallelizable problems.


Check course scheduling information



Add to Portfolio (opens a new window)