CSCI 842

Algorithms and Complexity.

North Dakota State University · UGRD · Fall 2026

1 section

Catalog description

Linear and nonlinear recurrences, algebraic problems, fast Fourier transforms, lower bound theory, computational geometry, the classes P and NP-completeness, Cook's theorem, NP-hard problems. Prereq: CSCI 741 .

Sections

Current meeting, instructor, credit, and enrollment details

Updated 6 hours ago

001

Availability not recently verified

Class #north_dakota_state-1543Fall 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?