CSE 550
Combinatorial Algorithms and Intractability
Arizona State University Digital Immersion · UGRD · Fall 2026
1 section
Catalog description
Combinatorial algorithms, nondeterministic algorithms, classes P and NP, NP-hard and NP-complete problems, and intractability. Design techniques for fast combinatorial algorithms.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #arizona_digital_immersion-3291Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?