Apr 19, 2024  
2013-2014 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: 2013-2014
  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
  Undergraduate Student Life
  Graduate Admissions
  Graduate Academic Requirements & Regulations
  Graduate Student Finances
  Research
  Community Based Learning
  Continuing Education and Training Programs
  Administration Personnel
  Student Enrollment Statistics
  Catalog PDF Extract
  My Portfolio
HELP
2013-2014 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.


Add to Portfolio (opens a new window)